2,870 views
2 votes
2 votes
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s.

2 Answers

0 votes
0 votes
4 States.....can be construted using product automata

Dfa that accepts odd no of zeros contain 2 states and dfa that accepts odd no of 1 will also contain 2 states so product automata will contain 2×2=4 states

Related questions

1 votes
1 votes
1 answer
1
samarpita asked Nov 21, 2021
537 views
What will be the answer
0 votes
0 votes
1 answer
2
himgta asked Jul 30, 2018
704 views
0 votes
0 votes
2 answers
3
gateexplore asked Jun 11, 2023
197 views
Construct finite automaton corresponding to regular expression (a + b)*cd*e
0 votes
0 votes
2 answers
4
gateexplore asked Jun 11, 2023
221 views
Construct NFA for the set of strings Σ={0, 1} of alternate 0's and 1's