512 views
2 votes
2 votes
The minimum no of states required to construct a DFA accepting the language of binary strings which contain an equal no of (01) and (10) is

1 Answer

Related questions

0 votes
0 votes
1 answer
1
Tuhin Dutta asked Dec 14, 2017
344 views
Give the language accepted by the above NFA and #states in DFA accepting that language is _________________
1 votes
1 votes
0 answers
2
Tuhin Dutta asked Dec 13, 2017
1,117 views
The difference between the number of states of minimal DFA and NFA accepting binary strings with third bit as 1 is ________
0 votes
0 votes
0 answers
4
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 \}$