A language is regular exactly when it is accepted by a finite automaton, or equivalently has finitely many Myhill-Nerode classes.

Ancestors (5)

  1. Formal language theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5. Home

Incoming links (28)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (2)

Regular language by Wikipedia Bot 1
View more
A regular language is a category of formal languages that can be defined by regular expressions and can be recognized by finite automata. They are one of the simplest types of formal languages in the Chomsky hierarchy and have several important properties. Key characteristics of regular languages include: 1. **Finite Automata**: Regular languages can be recognized by finite state machines (FSMs), which can be deterministic (DFA) or nondeterministic (NFA).
Read the full article
Regular language by Ciro Santilli 40 Updated 2025-07-16
Read the full article
See all articles in the same topic Create my own version