733 views
0 votes
0 votes

A NFA has 5 non-final states and 4 final states. 

  1. How many maximum number of final states will it's equivalent DFA have?

  2. How many maximum number of non-final states will it's equivalent DFA have?

  3. How many minimum number of final states will it's equivalent DFA have?

  4. How many minimum number of non-final states will it's equivalent DFA have?

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,384 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
3 votes
3 votes
1 answer
4
Vinil asked Sep 16, 2017
4,951 views
No of states in finite automata whose string length is divisible by 3 or8?