Question: Let = {0,1} and let D = {w|w contains an equal number of occurrences of the substrings 01 and 10}. Thus 101 D
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.
Step by Step Solution
3.35 Rating (158 Votes )
There are 3 Steps involved in it
Notice that regular languages are not closed under the subsetsuperset relation The union and interse... View full answer
Get step-by-step solutions from verified subject matter experts
