Misplaced Pages

The following pages link to Template:Formal languages and grammars

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

Showing 50 items.

• Chomsky hierarchy (transclusion) (links | edit)
• Context-sensitive grammar (transclusion) (links | edit)
• Context-sensitive language (transclusion) (links | edit)
• Context-free grammar (transclusion) (links | edit)
• Context-free language (transclusion) (links | edit)
• Finite-state machine (transclusion) (links | edit)
• Formal language (transclusion) (links | edit)
• Pushdown automaton (transclusion) (links | edit)
• Regular expression (transclusion) (links | edit)
• Regular language (transclusion) (links | edit)
• Regular grammar (transclusion) (links | edit)
• String (computer science) (transclusion) (links | edit)
• Turing machine (transclusion) (links | edit)
• Recursively enumerable language (transclusion) (links | edit)
• Tree automaton (transclusion) (links | edit)
• Automata theory (transclusion) (links | edit)
• Büchi automaton (transclusion) (links | edit)
• Generative grammar (transclusion) (links | edit)
• Tree-adjoining grammar (transclusion) (links | edit)
• Deterministic finite automaton (transclusion) (links | edit)
• Nondeterministic finite automaton (transclusion) (links | edit)
• Finite-state transducer (transclusion) (links | edit)
• Kuroda normal form (transclusion) (links | edit)
• Decider (Turing machine) (transclusion) (links | edit)
• Linear grammar (transclusion) (links | edit)
• Linear bounded automaton (transclusion) (links | edit)
• Pumping lemma for regular languages (transclusion) (links | edit)
• Semi-Thue system (transclusion) (links | edit)
• Pumping lemma for context-free languages (transclusion) (links | edit)
• Deterministic automaton (transclusion) (links | edit)
• Deterministic pushdown automaton (transclusion) (links | edit)
• Unrestricted grammar (transclusion) (links | edit)
• Star-free language (transclusion) (links | edit)
• Recursive grammar (transclusion) (links | edit)
• Regular tree grammar (transclusion) (links | edit)
• Deterministic acyclic finite state automaton (transclusion) (links | edit)
• Turing machine examples (transclusion) (links | edit)
• Indexed language (transclusion) (links | edit)
• Deterministic context-free language (transclusion) (links | edit)
• Nested stack automaton (transclusion) (links | edit)
• Deterministic context-free grammar (transclusion) (links | edit)
• Noncontracting grammar (transclusion) (links | edit)
• Indexed grammar (transclusion) (links | edit)
• Embedded pushdown automaton (transclusion) (links | edit)
• Aperiodic finite state automaton (transclusion) (links | edit)
• Formal grammar (transclusion) (links | edit)
• Recursive language (transclusion) (links | edit)
• UML state machine (transclusion) (links | edit)
• Nested word (transclusion) (links | edit)
• Head grammar (transclusion) (links | edit)