hw9a - Copy (2)

hw9a - Copy (2) - M From i -closure q i q,q 2 1 q 1 2 q 2...

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 9, Due 11/10/03 Name Student ID Page 1 Use Theorem 6.5.3 and Algorithm 6.6.3 (Sudkamp 6.35 page 193) a) Build an NFA M 1 that accepts ( ab ) * q 1 j q 0 gj a b b) Build an NFA M 2 that accepts ( ba ) * q 1 j q 0 gj b a c) Use λ transitions to obtain a machine M that accepts ( ab ) * ( ba ) * q 1 j q 3 j q 0 gj q 2 gj a b λ b a d) Give the input transition function t for
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: M . From i λ-closure ( q i ) { q ,q 2 } 1 { q 1 } 2 { q 2 } 3 { q 3 } We get t a b q { q 1 } { q 3 } q 1 ∅ { q ,q 2 } q 2 ∅ { q 3 } q 3 { q 2 } ∅ e) Use Algorithm 6.6.3 to construct a state diagram that accepts L ( M ). q 1 q 3 ∅ q ,q 2 q 2 a b a b b a b a 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