The following pages link to Introduction to Automata Theory, Languages, and Computation
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Context-free grammar (links | edit)
- Context-free language (links | edit)
- Computational complexity theory (links | edit)
- Finite-state machine (links | edit)
- Formal language (links | edit)
- Kleene star (links | edit)
- Pushdown automaton (links | edit)
- Regular language (links | edit)
- Rice's theorem (links | edit)
- Theory of computation (links | edit)
- Turing machine (links | edit)
- Gödel's incompleteness theorems (links | edit)
- Automata theory (links | edit)
- State diagram (links | edit)
- John Hopcroft (links | edit)
- Myhill–Nerode theorem (links | edit)
- Square pyramidal number (links | edit)
- Ambiguous grammar (links | edit)
- Deterministic finite automaton (links | edit)
- Nondeterministic finite automaton (links | edit)
- Pairing function (links | edit)
- Powerset construction (links | edit)
- Jeffrey Ullman (links | edit)
- Syntactic Structures (links | edit)
- Linear grammar (links | edit)
- Linear bounded automaton (links | edit)
- Pumping lemma for regular languages (links | edit)
- Anil Nerode (links | edit)
- Cinderella book (redirect page) (links | edit)
- Cinderella Book (redirect page) (links | edit)
- Deterministic pushdown automaton (links | edit)
- Alphabet (formal languages) (links | edit)
- Unrestricted grammar (links | edit)
- Introduction to automata theory, languages, and computation (redirect page) (links | edit)
- Description number (links | edit)
- List of PSPACE-complete problems (links | edit)
- Abstract family of languages (links | edit)
- Indexed grammar (links | edit)
- Cone (formal languages) (links | edit)
- Rajeev Motwani (links | edit)
- DFA minimization (links | edit)
- Introduction to the Theory of Computation (links | edit)
- Formal Languages and their Relation to Automata (redirect page) (links | edit)
- Symbol (formal) (links | edit)
- Nested word (links | edit)
- Arden's rule (links | edit)
- Cross-serial dependencies (links | edit)
- History of software (links | edit)
- Quotient automaton (links | edit)
- Emptiness problem (links | edit)