Linked from

The 15 pages that link to Regular expression, each with the reason it gives.

• Formal languageRelated: Regular expressions provide concise descriptions of languages built from simple pattern operations.

• Finite-state machineRelated: Regular expressions describe exactly the languages recognized by finite automata.

• Regular languageRelated: Every regular language has an equivalent regular expression.

• Formal grammarCompared with: Regular expressions specify the same language class as regular grammars in a different form.

• ParsingCompared with: Regular expressions handle simpler patterns, while nested structure generally requires grammar-based parsing.

• Deterministic finite automatonCompared with: It describes the same class of languages without specifying states and transitions.

• Finite automatonRelated: Regular expressions can be compiled into finite automata for matching.

• String (computer science)Related: Regular expressions specify string patterns for recognition and search.

• Chomsky hierarchyRelated: Regular expressions offer a practical description of the hierarchy’s bottom class.

• Pumping lemma for regular languagesRelated: Showing a language is nonregular rules out any regular expression describing it.

• Automata theoryRelated: Automata equivalence makes regular expressions a practical way to specify recognizable patterns.

• ParserCompared with: Regular expressions suit token patterns but generally cannot express recursively nested syntax.

• State machineCompared with: It describes the same language class as finite automata in a different form.

• Myhill–Nerode theoremRelated: The theorem determines whether a language described this way admits a finite-state representation.

• String-searching algorithmRelated: Regex engines use string-matching techniques alongside automata and backtracking.