Register

MadeEasy Subject Test: Theory of Computation - Finite Automata

• edited by
259 views

1 Answer

1 votes
1 votes
In given automata, Q1 and Q2 will be merged , because (Q1,a)=Q3, (Q1,b)=Q3 and (Q2,a)=Q3, (Q2,b)=Q3

all these four transitions are leading to same state i.e.. Q3, hence the resultant states in minimized dfa will be {Q0}, {Q1, Q2} and {Q3}
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
Link Copied!