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
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
3 years ago
Get the weekly newsletter!
see an example newsletter