@openstem shared this note
Software · L5 · Automata Theory & Formal Languages
DFA/NFA equivalence via subset construction, regular expressions, the pumping lemma with proof sketch, and context-free grammars in the Chomsky hierarchy.
Software
Updated 0
0
Read only
More in Software
Browse Software- Software · L2 · Git & Dev Workflow: Resolving a Merge Conflictnote
- Software · L2 · MongoDB: Replica Sets & Failovernote
- Software · L5 · Compiler Construction Theorynote
- Software · L1 · Operating Systems: The Process Lifecyclenote
- Software · L5 · Type Theory and the λ-Calculusnote
- Software · L2 · PostgreSQL: Replication & High Availabilitynote