Ace-ots
closed

closed by
482 views
0 votes
0 votes
closed with the note: dulicate question
Number of states in MFA that accepts all the strings of a's and b's where each string contains atmost 5 a's and atmost 6 b's is.....
closed by

Related questions

0 votes
0 votes
1 answer
1
Pratik.patil asked Feb 6
173 views
A.330 B.388 C.279 D.389Can someone please give detailed solution to this?
0 votes
0 votes
0 answers
2
HeadShot asked Dec 11, 2018
380 views
Answer : Option A Doubt : 0 repeated n-1 times and a single 1 , then how <0,n ?
0 votes
0 votes
2 answers
3
HeadShot asked Dec 11, 2018
355 views
Why 50 * 3 and not 50+3 ?Does every Byte requires different instruction ?
0 votes
0 votes
0 answers
4
HeadShot asked Dec 11, 2018
335 views
Answer : Option C Please explain ( Why do we need to assume that there were seperate tables related to customer and store ? )