Misplaced Pages

The following pages link to Regular grammar

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

Showing 50 items.

• Suffix array (links | edit)
• Decider (Turing machine) (links | edit)
• Smith–Waterman algorithm (links | edit)
• FleXML (links | edit)
• Boyer–Moore–Horspool algorithm (links | edit)
• Linear grammar (links | edit)
• Linear bounded automaton (links | edit)
• Pumping lemma for regular languages (links | edit)
• Longest common substring (links | edit)
• Bitap algorithm (links | edit)
• Semi-Thue system (links | edit)
• Ternary search tree (links | edit)
• Substring index (links | edit)
• Generalized suffix tree (links | edit)
• Pumping lemma for context-free languages (links | edit)
• Levenshtein automaton (links | edit)
• Damerau–Levenshtein distance (links | edit)
• Approximate string matching (links | edit)
• Zhu–Takaoka string matching algorithm (links | edit)
• Deterministic automaton (links | edit)
• Comparison of parser generators (links | edit)
• Deterministic pushdown automaton (links | edit)
• Expressive power (computer science) (links | edit)
• Unrestricted grammar (links | edit)
• Star-free language (links | edit)
• Sequential pattern mining (links | edit)
• Recursive grammar (links | edit)
• Regular tree grammar (links | edit)
• Deterministic acyclic finite state automaton (links | edit)
• Turing machine examples (links | edit)
• Jaro–Winkler distance (links | edit)
• C++ string handling (links | edit)
• Indexed language (links | edit)
• Deterministic context-free language (links | edit)
• List of PSPACE-complete problems (links | edit)
• Nested stack automaton (links | edit)
• String metric (links | edit)
• Hirschberg's algorithm (links | edit)
• Deterministic context-free grammar (links | edit)
• String operations (links | edit)
• Left regular grammar (redirect page) (links | edit)
  • Talk:Prefix grammar (links | edit)
• Right regular grammar (redirect page) (links | edit)
• Comparison of regular expression engines (links | edit)
• Noncontracting grammar (links | edit)
• Indexed grammar (links | edit)
• Stochastic grammar (links | edit)
• Embedded pushdown automaton (links | edit)
• Apostolico–Giancarlo algorithm (links | edit)
• Lee distance (links | edit)
• Aperiodic finite state automaton (links | edit)