696 views
0 votes
0 votes
1. For a $N$ state DFA its equivalent NFA would contain how many numbers of states:-

a) In worst case?

b) In best case?

2. For a $N$ state NFA its equivalent DFA would contain how many numbers of states:-

a) In worst case?

b) In best case?

1 Answer

0 votes
0 votes
1. Every DFA is a NFA.

    Worst Case : N

    Best Case : N

2.If NFA have N states, then DFA have

    Worst Case : 2^N

    Best Case : 1
edited by

Related questions

3 votes
3 votes
2 answers
1
0 votes
0 votes
1 answer
2
gateexplore asked Jun 11, 2023
442 views
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answ...
0 votes
0 votes
0 answers
3
vishnu777 asked Nov 24, 2022
215 views
Can anyone explain what is the meaning of saying set of some languages is another language.Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which ...
1 votes
1 votes
1 answer
4