hw6a - Copy (2)

hw6a - Copy (2) - substring aaa . q e j q gj q 1 gj q 2 gj...

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 6, Due 10/20/03 Sample Answers Page 1 1. (Sudkamp 6.5 page 189) Build a DFA that accepts the set of strings over { a,b,c } in which all the a ’s precede the b ’s, which in turn precede the c ’s. It is possible that there are no a ’s, b ’s or c ’s. q e j q 0 gj q 1 gj q 2 gj a b b c a c a,b a,b,c c 2. (Sudkamp 6.6 page 189) Build a DFA that accepts the set of strings over { a,b } in which the substring aa occurs at least twice. q 0 j q 1 j q 2 j q 3 j q 4 gj b a b a b a a b a,b 3. (Sudkamp 6.7 page 189) Build a DFA that accepts the set of strings over { a,b } that do not begin with the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: substring aaa . q e j q gj q 1 gj q 2 gj q 3 gj a b a b b a a,b a,b 4. (Sudkamp 6.8 page 189) Build a DFA that accepts the set of strings over { a,b } that do not contain the substring aaa . q e j q gj q 1 gj q 2 gj q 3 gj a b a b a b a a,b b 5. (Sudkamp 6.9 page 189) Build a DFA that accepts the set of strings over { a,b,c } that begin with a , contain exactly two b ’s, and end with cc . q j q 1 j q 2 j q 3 j q 4 j q e j q 5 gj a b,c a,c b a,c b a b c a b c c b a,b,c a...
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