Let L be the language on Σ = {0, 1} consisting of words that endin either 01 or 10 and contain neither 010 nor 101 as asubstring.
(a) Find a DFA A that recognises (accepts) L. Six states will besufficient. Label the initial state S, other non-accepting statesT, U, . . ., and accepting states X, Y, . . ..
(b) Find a regular expression R for the language L. Do this byapplying the ‘eliminating vertices’ algorithm (described inlectures and the course notes) to your automaton A from Question 1.It’s OK to compress several steps into one.
(c) Show how 0111001100001 matches your
PayPal Gateway not configured
PayPal Gateway not configured