Pages that link to "Pushdown automaton"
Appearance
Showing 50 items.
- Computation(links|edit)
- Chomsky hierarchy(links|edit)
- Context-sensitive grammar(links|edit)
- Context-sensitive language(links|edit)
- Context-free grammar(links|edit)
- Context-free language(links|edit)
- Finite-state machine(links|edit)
- Formal language(links|edit)
- History of computing hardware(links|edit)
- Pushdown automaton(transclusion) (links|edit)
- Regular expression(links|edit)
- Regular language(links|edit)
- Regular grammar(links|edit)
- String (computer science)(links|edit)
- Theory of computation(links|edit)
- Turing machine(links|edit)
- Turing completeness(links|edit)
- Greibach normal form(links|edit)
- Recursively enumerable language(links|edit)
- Abstract machine(links|edit)
- PDA(links|edit)
- Combinational logic(links|edit)
- Tree automaton(links|edit)
- Index of computing articles(links|edit)
- Automata theory(links|edit)
- Push-down automaton(redirect page) (links|edit)
- Probabilistic context-free grammar(links|edit)
- Büchi automaton(links|edit)
- List of computability and complexity topics(links|edit)
- Pushdown automata(redirect page) (links|edit)
- Context-free language(links|edit)
- Turing machine(links|edit)
- Automata theory(links|edit)
- Sheila Greibach(links|edit)
- Ambiguous grammar(links|edit)
- Model of computation(links|edit)
- Conjunctive grammar(links|edit)
- Computation history(links|edit)
- Deterministic context-free language(links|edit)
- Deterministic context-free grammar(links|edit)
- Abstract family of acceptors(links|edit)
- JFLAP(links|edit)
- User:Pengo/comp(links|edit)
- Wikipedia:Reference desk/Archives/Computing/2007 January 8(links|edit)
- Wikipedia:Reference desk/Archives/Science/2013 August 24(links|edit)
- Wikipedia:Reference desk/Archives/Computing/2014 June 28(links|edit)
- Computability(links|edit)
- Generative grammar(links|edit)
- Stack machine(links|edit)
- Sheila Greibach(links|edit)
- Stack automaton(redirect to section "Stack automata") (links|edit)
- Tree-adjoining grammar(links|edit)
- Deterministic finite automaton(links|edit)
- Nondeterministic finite automaton(links|edit)
- National Parliamentary Debate Association(links|edit)
- Graph-structured stack(links|edit)
- List of terms relating to algorithms and data structures(links|edit)
- Finite-state transducer(links|edit)
- Kuroda normal form(links|edit)
- List of undecidable problems(links|edit)
- Decider (Turing machine)(links|edit)
- Linear grammar(links|edit)
- Linear bounded automaton(links|edit)
- Greek letters used in mathematics, science, and engineering(links|edit)
- Pumping lemma for regular languages(links|edit)
- Semi-Thue system(links|edit)