Design a DFA L(M) = {w | w ε {0, 1}*} and W is a string that does not contain consecutive 1’s.

Question

Design a DFA L(M) = {w | w ε {0, 1}*} and W is a string that does not contain consecutive 1&#8217;s.

Suresh Chand · Accepted Answer

When three consecutive 1's occur the DFA will be: Here two consecutive 1's or a single 1 is acceptable, hence The stages q0, q1, and q2 are the final states. The DFA will generate the strings that do not contain consecutive 1's like 10, 110, 101,..... etc.

Design a DFA L(M) = {w | w ε {0, 1}*} and W is a string that does not contain consecutive 1’s.

Leave your Answer:

Hits Counter

Question

Design a DFA L(M) = {w | w ε {0, 1}*} and W is a string that does not contain consecutive 1’s.

Leave your Answer: