An automaton accepting a regular language is irreducible exactly when it has the smallest possible number of states among deterministic automata accepting that language. The irreducible automaton is unique up to isomorphism; its states correspond to the Myhill--Nerode equivalence classes.

Ancestors (12)

  1. iv
  2. a
  3. 12F
  4. Paper 3
  5. ii
  6. 2025
  7. Past exam of the mathematics course of the University of Cambridge
  8. Mathematics course of the University of Cambridge
  9. Course of the University of Cambridge
  10. University of Cambridge
  11. List of universities
  12. 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