The Gateway to Computer Science Excellence
0 votes
56 views

 

in Theory of Computation by Loyal (6.9k points) | 56 views
0
How can one tell number of states in NFA from states of an arbitrary DFA
0
It's b
because a DFA is an NFA. So the states can remain to be the same.
0
@vikas @dharmendra @mk Utkarsh

Im not able to understand this concept.

Please explain.

As per my understanding in DFA, For N states there can be N transition so N states should be there and for NFA for N states there can be 2 ^N transition so 2^N states.

Please suggest
0

Mayankprakash ignore this question because they are not talking about minimal DFA

if they would have been talking about minimal DFA with $2^N$ states then states in the corresponding NFA can range between $N$ and $2^N$

from this information we can eliminate A and D

but then read the first line of this comment :p

0
@mk Utkarsh

if they would have been talking about minimal DFA with $2^N$ states then states in the corresponding NFA can range between $N$ and

How?

Please explain

1 Answer

0 votes
Every DFA can be NFA. If NFA have 'n' states then DFA have maximum 2^n states.

So option B is correct.

Power of NFA = Power of DFA
by Active (1.7k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,616 answers
195,897 comments
102,348 users