Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Can somebody provide an example of two equivalent (recognizing the same language) minimal non-deterministic automata (NFA) which are not isomorphic?

share|cite|improve this question
See the comment by mikero on… – Tsuyoshi Ito Oct 25 '12 at 13:46

See the paper (postscript)

Arnold, Dicky, Nivat. A note about minimal non-deterministic automata

share|cite|improve this answer
Thank you for sharing! Their paper includes a nice example. :) – Michael Wehar Jun 11 '15 at 5:10

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.