hw9 - transitions to obtain a machine M that accepts ( ab )...

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 ) * b) Build an NFA M 2 that accepts ( ba ) * c) Use
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: transitions to obtain a machine M that accepts ( ab ) * ( ba ) * d) Give the input transition function t for M . e) Use Algorithm 6.6.3 to construct a state diagram that accepts L ( M )....
View Full Document

Ask a homework question - tutors are online