Consider the following Language over the alphabet f0,1g: fw j w contains an equal number of occurrences of the substrings 01 and
10g. Thus 101 2 A because 101 contains a single 01 and a single 10. Show that L2 is a regular language.
1 answer:
Answer:
I will show that this language is regular because it can be described by a regular expression and a FA (NFA)
Explanation:
The regular expression for the language is: (1⁺0*1⁺)* + (0⁺1*0⁺)*
NFA and DFA diagram chat that show that L2 is a regular language as shown below. at every loop, the language L2 comfortably repeats itself.
You might be interested in