643 views
0 votes
0 votes
Find minimal dfa's for the following languages. In each case prove that the result is minimal.
(a) $L =$ {$a^n b^m :n≥2,m≥1$}.
(b) $L =$ {$a^n b:n ≥0$} $∪$ {$b^n a:n ≥1$}
(c) $L =$ {$a^n :n ≥ 0,n ≠ 3$}.
(d) $L =$ {$a^n:n ≠ 2$ and $n ≠4$}.
(e) $L =$ {$a^n:n$ mod $3 = 0$} $∪$ {$a^n: n$ mod $5 = 1$}.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4
Naveen Kumar 3 asked Mar 30, 2019
261 views
Prove the following: If the states $q_a$ and $q_b$ are indistinguishable, and if $q_a$ and $q_c$ aredistinguishable, then $q_b$ and $q_c$ must be distinguishable.