Misplaced Pages

The following pages link to Linear bounded automaton

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• 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)
• Pushdown automaton (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)
• Recursively enumerable language (links | edit)
• Tree automaton (links | edit)
• Automata theory (links | edit)
• LBA (links | edit)
• Malbolge (links | edit)
• Büchi automaton (links | edit)
• Generative grammar (links | edit)
• Referential integrity (links | edit)
• Tree-adjoining grammar (links | edit)
• Deterministic finite automaton (links | edit)
• Nondeterministic finite automaton (links | edit)
• Space hierarchy theorem (links | edit)
• Finite-state transducer (links | edit)
• Kuroda normal form (links | edit)
• Decider (Turing machine) (links | edit)
• Linear grammar (links | edit)
• Pumping lemma for regular languages (links | edit)
• Semi-Thue system (links | edit)
• Immerman–Szelepcsényi theorem (links | edit)
• Linear bounded automata (redirect page) (links | edit)
  • Computational complexity theory (links | edit)
  • Automata theory (links | edit)
  • Space hierarchy theorem (links | edit)
  • List of PSPACE-complete problems (links | edit)
• Pumping lemma for context-free languages (links | edit)
• Deterministic automaton (links | edit)
• Deterministic pushdown automaton (links | edit)
• LBA-compete (redirect page) (links | edit)
• LBA compete (redirect page) (links | edit)
• Unrestricted grammar (links | edit)
• Star-free language (links | edit)
• Recursive grammar (links | edit)
• Regular tree grammar (links | edit)
• Deterministic acyclic finite state automaton (links | edit)
• Turing machine examples (links | edit)
• Indexed language (links | edit)
• Deterministic context-free language (links | edit)
• Nested stack automaton (links | edit)
• Deterministic context-free grammar (links | edit)