This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: What is the regular expression for 2 43 R for the above state diagram? You do not need to use the formula in (a) to get your answer to parts (b) and (c). Over 1 2 3 4 0 0 1 0 1 1 0 1 3. Let ) , , , , ( F q Q M δ Σ = be a deterministic finite automata. Let K= }    ), ( *  { x y M L y and x x = ∈ ∃ Σ ∈ . (a) Describe in English the set K. (b) Construct a nondeterministic finite automaton ) , , , , ( 2 02 2 2 2 F q Q M Σ = accepting the set K. 4.Let R be a regular set over the alphabet } , { b a = Σ . For each string in R replace the first occurrence of the substring baa by ba. Let R ˆ be the resulting set of strings. Show by using homomorphisms, inverse homomorphisms and intersection with regular sets that R ˆ is regular....
View
Full Document
 Fall '07
 HOPCROFT
 Regular expression, Nondeterministic finite state machine, 50 minute, Olin

Click to edit the document details