279 views
0 votes
0 votes
Show that given a regular language L its minimal dfa is unique within a simple relabeling of states?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4