Which phrase best defines characterization?
1 answer:
You might be interested in
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.
