hw7a - Copy (2)

hw7a - Copy (2) - 2. (Sudkamp 6.20 page 191) Give the state...

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 7, Due 10/27/03 Name Student ID Page 1 1. (Sudkamp 6.19 page 191) For each of the following languages, give the state diagram of an NFA that accepts the languages. a) ( ab ) * a * q 1 j q 0 gj q 2 gj q 3 gj a a b a a b) ( abc ) * a * q 1 j q 2 j q 0 gj q 3 gj a a b a c c) ( ba bb ) * ( ab aa ) * q 1 j q 3 j q 0 gj q 2 gj q 4 gj b a a,b b a,b a d) ( ab + a ) + q 0 j q 1 j q 2 j q 3 gj a b a a b
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2. (Sudkamp 6.20 page 191) Give the state diagram of an NFA that accepts the set of strings over { 1 , 2 , 3 } the sum of whose elements is divisible by six. q 1 j q 2 j q 3 j q 4 j q 5 j q gj 1 1 1 1 1 1 2 2 2 2 2 2 3 3 3 3 3 3...
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