Misplaced Pages

The following pages link to Tree-adjoining grammar

• (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)
• Grammar (links | edit)
• Pushdown automaton (links | edit)
• Regular expression (links | edit)
• Regular language (links | edit)
• Regular grammar (links | edit)
• Syntax (links | edit)
• String (computer science) (links | edit)
• Standard Generalized Markup Language (links | edit)
• Turing machine (links | edit)
• Big O notation (links | edit)
• Recursively enumerable language (links | edit)
• Transformational grammar (links | edit)
• Tree automaton (links | edit)
• Automata theory (links | edit)
• Lexical functional grammar (links | edit)
• Büchi automaton (links | edit)
• Tag (links | edit)
• Generative grammar (links | edit)
• Tree adjoining grammars (redirect page) (links | edit)
  • Indexed language (links | edit)
  • Talk:Chomsky–Schützenberger representation theorem (links | edit)
• Deterministic finite automaton (links | edit)
• Nondeterministic finite automaton (links | edit)
• List of formal language and literal string topics (links | edit)
• Tree-Adjoining Grammar (redirect page) (links | edit)
  • Zellig Harris (links | edit)
  • Anne Abeillé (links | edit)
• Dependency grammar (links | edit)
• Finite-state transducer (links | edit)
• Kuroda normal form (links | edit)
• Tree adjoining grammar (redirect page) (links | edit)
  • Generalized context-free grammar (links | edit)
  • Talk:Formal grammar/Archive 1 (links | edit)
  • User:Cadr (links | edit)
• Decider (Turing machine) (links | edit)
• Aravind Joshi (links | edit)
• Linear grammar (links | edit)
• Linear bounded automaton (links | edit)
• Pumping lemma for regular languages (links | edit)
• Semi-Thue system (links | edit)
• Rumelhart Prize (links | edit)
• Pumping lemma for context-free languages (links | edit)
• Deterministic automaton (links | edit)
• Deterministic pushdown automaton (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)