Register

Toc NFa to DFA

417 views

1 Answer

Best answer
3 votes
3 votes

while converting 'n' state NFA into DFA you can get almost 2n states only. and those states are final states in DFA which contain atleast one final state of DFA. therefore this problem turned into no.of subsets of {a,b,c,d,e} which contain either d or e

= 24(for d) + 24 ( for e ) - 23 ( which are common for both d and e)

= 16+16-8

= 24

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
ck asked Dec 22, 2018
1,264 views
selfdoubt
Give an example of DFA minimization where the initial state is final state and there are one or more final states
Give an example of DFA minimization where the initial state is final state and there are one or more final states
User Avatar
0 votes
0 votes
1 answer
2
aditi19 asked Dec 14, 2018
1,334 views
Conversion of NFA to DFA
convert the following NFA to DFA
convert the following NFA to DFA
User Avatar
1 votes
1 votes
0 answers
4
smsubham asked Apr 8, 2018
823 views
Worst Case in NFA to DFA Conversion
Can you give an example of NFA which has n states and its corresponding DFA has 2^n states?
Can you give an example of NFA which has n states and its corresponding DFA has 2^n states?
User Avatar
Link Copied!