hw3 - b s, which in turn precede all the c s. It is...

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 3, Due 9/29/03 Name Student ID Page 1 1. (Sudkamp Problem 2.10, Page 49) Let X = { aa,bb } and Y = { λ,b,ab } . a) List the strings in the set XY . b) List the strings of the set Y * of length 3 or less. c) How many strings of length 6 are there in X * ? 2. (Sudkamp Problem 2.11, Page 50) Let L 1 = { aaa } * , L 2 = { a,b }{ a,b }{ a,b }{ a,b } , and L 3 = L * 2 . Describe the strings that are in the languages a) L 2 b) L 3 c) L 1 L 3 3. (Sudkamp Problem 2.13, Page 50) Give a regular expression that represents the set of strings over { a,b,c } in which all the a ’s precede all 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: b s, which in turn precede all the c s. It is possible that there are no a s, b s or c s. However, is not in the set. 4. (Sudkamp Problem 2.22, Page 50) Give a regular expression that represents the set of strings over { a,b,c } that begin with a , contain exactly two b s, and end with cc . 5. (Sudkamp Problem 2.34, Page 50) Give a regular expression that represents the set of strings over { a,b,c } with an odd number of occurrences of the substring ab ....
View Full Document

Ask a homework question - tutors are online