Let = {0,1} and let D = {w|w contains an equal number of occurrences of the

Question:

Let  = {0,1} and let

D = {w|w contains an equal number of occurrences of the substrings 01 and 10}.

Thus 101 ∈ D because 101 contains a single 01 and a single 10, but 1010 ∉ D because 1010 contains two 10s and one 01. Show that D is a regular language.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: