Question: Suppose L is a regular language, and M = (Q, , , q0, A) is a deterministic finite state machine such that L(M) = L.
Suppose L is a regular language, and M = (Q, , , q0, A) is a deterministic finite state machine such that L(M) = L. Prove that if |Q| = 2 then one of the following hold: (i)L= (ii) L,or (iii) a such that aL.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
