Register

MadeEasy Subject Test 2019: Theory Of Computation - Finite Automata

• edited by
909 views
0 votes
0 votes

what is the answer

• edited by
User Avatar

1 Answer

0 votes
0 votes
apply arden theoreom and then add Q0 and Q2.(both are final states)

hence ans is D
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Magma asked Jan 15, 2019
535 views
MadeEasy Subject Test 2019: Theory of Computation - Finite Automata
Consider the following NFA M , over the alphabet {a} let L(M) be the language accepted by the NFA M . let $M'$ ... $L (M' ) - L(M)) = phi$ $L (M' ) \cup L(M)) = phi$
Consider the following NFA M , over the alphabet {a}let L(M) be the language accepted by the NFA M . let $M'$ denote the machine obtained by the final and non final sta...
User Avatar
0 votes
0 votes
1 answer
4
Hradesh patel asked Jan 21, 2017
262 views
MadeEasy Subject Test: Theory of Computation - Finite Automata
# plz check its 4 or 3 ?? here i used equivalance method ?? i got 4
# plz check its 4 or 3 ?? here i used equivalance method ?? i got 4
User Avatar
Link Copied!