13,914 views

1 Answer

Best answer
3 votes
3 votes

Number of finfinal state(s) require to accept Φ in minimal finite automata is ZERO.
Number of state(s) require to accept Φ in finite automata is ONE.


 

selected by

Related questions

7 votes
7 votes
2 answers
1
debanjan sarkar asked Sep 30, 2016
4,490 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
3 answers
2
Pranay Datta 1 asked Oct 3, 2015
1,267 views
no of state in minimal finite automata that accept the string from alphabet {a,b,c} where no of a is divisible by 2 or 3 and no of c is divisible by 6?? plzz explain!!!
3 votes
3 votes
1 answer
3
0 votes
0 votes
0 answers
4