Register

Is this minimal DFA correct?

507 views
1 votes
1 votes

Is this the correct minimal DFA for a language over {a, b}, which accepts set of all strings in which every 'a' is followed by a 'b'?

User Avatar

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
1 answer
1
sripo asked Nov 6, 2018
3,041 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
0 answers
2
ankit-saha asked Mar 24, 2022
347 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
3
aditi19 asked Dec 14, 2018
1,554 views
Minimal DFA
Given following NFA find the minimal equivalent DFA
Given following NFAfind the minimal equivalent DFA
User Avatar
0 votes
0 votes
0 answers
4
Harshitha 123 asked Jun 12, 2018
417 views
Minimal dfa
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
User Avatar
Link Copied!