This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: a, b, c }. Construct non deterministic finite automata recognizing each of the following languages (describe each automaton using its 5tuple and pictorial diagram): a) { w  w contains the substring ab and the substring cb } b) { w  w contains the substring ab and the substring bc , where the two substrings may overlap, but bc cannot come before ab } 5. (15 points) NFAtoDFA Conversion: Convert the NFA below to an equivalent DFA using the process given in the proof of Theorem 1.39 (p. 5556). Show both the 5tuple and pictorial diagram for your DFA. After describing the result, remove any unreachable states to further simplify your DFA. q 1 q 2 q 3 a a b a b b q 1 q 3 a b q 2 UML CS Foundations 91.304 (section 201) Fall, 2011 2 of 2 6. (15 points) Closure of Regular Languages : Prove that if L 1 and L 2 and L 3 are regular languages, then the following language L 4 is also regular: ) ( 3 2 1 4 L L L L =...
View
Full
Document
 Fall '11
 Staff
 Computer Science

Click to edit the document details