1. Knowra
  2. Regular language
  3. Linked from

Linked from

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

All 13Broader topic 3Related 6Narrower topic 2Compared with 2

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

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

Machine generatedConnect to another ideaRandom page