Register

Minimal DFA

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

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
ankit-saha asked Mar 24, 2022
345 views
Minimal DFA
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$
User Avatar
0 votes
0 votes
2 answers
2
aditi19 asked Dec 14, 2018
1,545 views
Minimal DFA
Given following NFA find the minimal equivalent DFA
Given following NFAfind the minimal equivalent DFA
User Avatar
1 votes
1 votes
1 answer
3
sripo asked Nov 6, 2018
3,028 views
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
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?
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?
User Avatar
0 votes
0 votes
1 answer
4
Na462 asked Sep 10, 2018
992 views
Minimal DFA
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 > 1 and x >= 0 }.
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 1 and x >= 0 }.
User Avatar
Link Copied!