hw8a - Copy (2)

hw8a - Copy (2) - 3 q 1 ,q 3 q ,q 1 ,q 3 a a b b b a a b b...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MCS4653, Theory of Computation Homework Assignment 8, Due 11/3/03 Name Student ID Page 1 Prepare this problem for class discussion. (Sudkamp 6.30 page 192) Let M be the NFA- λ q 0 j q 2 j q 3 j q 1 gj λ,a b b λ b a b a a) Compute λ - closure ( q i ) for i = 0 , 1 , 2 , 3. i λ - closure ( q i ) 0 { q 0 ,q 1 } 1 { q 1 } 2 { q 2 ,q 3 } 3 { q 3 } b) Give the input transition function t for M . t a b q 0 { q 1 } { q 1 ,q 2 ,q 3 } q 1 { q 1 ,q 3 } q 2 { q 0 ,q 1 ,q 3 } { q 2 ,q 3 } q 3 { q 0 ,q 1 ,q 3 } { q 2 ,q 3 } c) Use Algorithm 6.6.3 to construct a state diagram that is equivalent to M . q 0 ,q 1 q 1 q 1 ,q 2 ,q
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3 q 1 ,q 3 q ,q 1 ,q 3 a a b b b a a b b a d) Give a regular expression for L ( M ). Try to simplify the diagram by eliminating node { q 1 ,q 3 } which is equivalent to node { q 1 ,q 2 ,q 3 } ∅ q ,q 1 q 1 q 1 ,q 2 ,q 3 q ,q 1 ,q 3 a a b b a b b a Then ( λ ∪ a )(( b + ( a ∪ b ) * ) ∪ λ )...
View Full Document

This note was uploaded on 09/26/2011 for the course TOC 1345 taught by Professor Joe during the Spring '11 term at HDM Stuttgart.

Ask a homework question - tutors are online