503 views
1 votes
1 votes
Number of states in  Minimal DFA  that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$

1 Answer

Related questions

0 votes
0 votes
0 answers
1
ankit-saha asked Mar 24, 2022
338 views
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$
0 votes
0 votes
2 answers
2
aditi19 asked Dec 14, 2018
1,503 views
Given following NFAfind the minimal equivalent DFA
1 votes
1 votes
1 answer
3
sripo asked Nov 6, 2018
2,977 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
0 votes
0 votes
1 answer
4
Na462 asked Sep 10, 2018
941 views
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 1 and x >= 0 }.