335 views
2 votes
2 votes
construct a DFA over {a,b} such that in each string,no of a's and b's are 2 ?

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
2
iarnav asked Sep 1, 2018
25,806 views
How to construct a finite automata equivalent to the regular expression: ( 0 + 1 )* ( 00 + 11 ) ( 0 + 1 )*
2 votes
2 votes
1 answer
3
rahul sharma 5 asked Jan 12, 2017
1,983 views
Some one please explain these two theorems,I am struggling a lot here.
0 votes
0 votes
1 answer
4
rahul sharma 5 asked Jan 11, 2017
962 views
If n state finite automata accespts infinite language then what is the length of min, and max. cycle?