Question: Let L be the language on = {0, 1} consisting of words that end in either 01 or 10 and contain neither 010 nor 101
Let L be the language on = {0, 1} consisting of words that end in either 01 or 10 and contain neither 010 nor 101 as a substring.Find a DFA A that recognises (accepts) L. Hence find a regular expression of A
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
