I have started to study formal languages, especially finite automata and regular languages and I encountered some difficulties, i.e. Is this true:
Automata will be called isomorphic if, by changing the names of the states, one moves from one automaton to the second. Let be a regular language. How can I Prove that all minimal automata for the language are isomorphic?
Thank you for any hints and answers!