Take the 2-minute tour ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

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

share|improve this question
See the comment by mikero on cstheory.stackexchange.com/questions/10829/… –  Tsuyoshi Ito Oct 25 '12 at 13:46

1 Answer 1

See the paper (postscript)

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

share|improve this answer

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.