OurBigBook About$ Donate
 Sign in Sign up

Myhill–Nerode theorem

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Theoretical computer science Formal languages
 0 By others on same topic  0 Discussions Create my own version
The Myhill–Nerode theorem is a fundamental result in formal language theory that provides a characterization of regular languages in terms of equivalence relations on strings. It offers a method to determine whether a language is regular and to construct the minimal deterministic finite automaton (DFA) that recognizes a given regular language.

 Ancestors (6)

  1. Formal languages
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook