Answer to Question #288197 in Software Engineering for Saibat Albasu

Question

Let L be the language consisting of all strings of a's and b's

containing the substring abba.

a) Construct a DFA for L

b) Represent the DFA for L as regular expression

b) Show the DFA for L scanning the shortest possible word

in L.

(Hint: A substring "abba" can comes at the beginning,

middle or end of a string of a's and b's of L)

Answer 1

Dear Saibat Albasu, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order