Linked from

The 13 pages that link to Regular language, each with the reason it gives.

• Formal languageBroader topic: Regular languages model many practical token patterns, including lexical forms in programming.

• Regular expressionRelated: It is the exact class of languages denoted by the formal notation.

• Context-free grammarCompared with: Regular languages form a narrower class than context-free languages.

• SemigroupRelated: Its syntactic semigroup encodes which word contexts distinguish its strings.

• Deterministic finite automatonRelated: Exactly the regular languages can be recognized by deterministic finite automata.

• Finite automatonNarrower topic: These are exactly the languages finite automata recognize.

• Transition functionRelated: A finite automaton’s transition function determines which strings it accepts.

• Chomsky hierarchyRelated: Regular languages form the smallest class in the hierarchy.

• Context-free languageCompared with: Every regular language is context-free, but regular languages cannot require unbounded nested matching.

• Pumping lemma for regular languagesRelated: The pumping guarantee applies to every language in this class.

• Automata theoryBroader topic: Regular languages form the simplest major class in the automata hierarchy.

• Myhill–Nerode theoremNarrower topic: The theorem identifies exactly which languages have finitely many equivalence classes.

• Computable setBroader topic: Finite automata provide a particularly simple way to decide membership in these computable sets.