A formal language with finitely many words. Every finite language is a regular language: take a finite union of the regular expressions spelling its members, with the empty language represented separately when there are no members.

Ancestors (5)

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

Incoming links (3)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version