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

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