The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

asked in Theory of Computation by Junior (523 points) | 61 views
Source of the question??

1 Answer

+2 votes
Best answer

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

answered by Boss (31.3k points)
selected by

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

40,851 questions
47,514 answers
62,274 users