965 views
0 votes
0 votes
My doubt is it always true that the  number of state in NFA is always less than number of state required in DFA for all language which are regular?

1 Answer

0 votes
0 votes
MAX NO. OF DFA STATES FOR N NFA STATES IS 2^n

IT MEANS AT MINIMUM LEVEL BOTH NFA AND DFA EQUAL

BUT AT MAX AROUND 2^n STATES

Related questions

0 votes
0 votes
1 answer
1
Souvik33 asked Nov 7, 2022
340 views
MSQ The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)010110
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
ambikesh_ak27 asked Feb 27, 2022
809 views
Convert the given epsilon NFA to minimal DFAhttps://gateoverflow.in/?qa=blob&qa_blobid=10553865129760839637
0 votes
0 votes
1 answer
4
Deepalitrapti asked Jun 6, 2019
263 views