136 views
0 votes
0 votes
I tried to draw DFA for - string w such that there are even a's and every a is followed by at least one b.

First I took two dfa's one for even no of a's and other for strings where every a is followed by atleast one b and took their intersection as answer. I ended up with a solution having 6 states.

But there is a solution online for the same problem with 5 states. So, DFA obtained via intersection of two DFA's doesn't ensure minimal DFA ?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
gateexplore asked Jun 11, 2023
208 views
Construct finite automaton corresponding to regular expression (a + b)*cd*e
0 votes
0 votes
2 answers
2
gateexplore asked Jun 11, 2023
232 views
Construct NFA for the set of strings Σ={0, 1} of alternate 0's and 1's
0 votes
0 votes
1 answer
3
gateexplore asked Jun 11, 2023
442 views
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answ...
0 votes
0 votes
1 answer
4
Shoto asked Dec 28, 2021
784 views
How many ‘n’ state FA are possible with ‘m’ symbols with –(i) Designated initial state(ii) With designated initial and final state(iii) With no designated initi...