Is the following language over 9 = {0,1} regular or not? Prove your answer. L3 = {w: the substring 01 occurs exactly as

[answerhappygod]

Is The Following Language Over 9 0 1 Regular Or Not Prove Your Answer L3 W The Substring 01 Occurs Exactly As 1 (28.46 KiB) Viewed 43 times

Is the following language over 9 = {0,1} regular or not? Prove your answer. L3 = {w: the substring 01 occurs exactly as often in w as the substring 10} (An example of a string in the language is 010 because there is one occurrence of the substring 01 and one occurrence of the substring 10. An example of a string NOT in the language is 0101 because there are two occurrences of the substring 01 but only one occurrence of the substring 10.)