323 views

Please log in or register to answer this question.

Related questions

7 votes
7 votes
2 answers
2
debanjan sarkar asked Sep 30, 2016
4,377 views
Number of states in minimal finite automata that accepts all binary strings that starts with 101 and is divisible by 100.A. 102B. 103C. 104D. 105
2 votes
2 votes
4 answers
3