This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Problem Set 3 Spring 10 Due: Thursday Feb 18 in class before the lecture. Please follow the homework format guidelines posted on the class web page: http://www.cs.uiuc.edu/class/sp10/cs373/ 1. [ Category : Comprehension, Points : 20] Give a regular expression for the following languages: (a) = { a,b } : The set of all strings where the second letter from the start and second letter from the end both are a 's (e.g. babaab ). (b) = { a,b } : The set of all strings that have both aa and bb as a (contiguous) substring. (c) = { a,b,c } : The set of all strings, such that between every a and c there's at least one b . Describe the language of each of the following regular expressions in your own words. Please be speci c and try to minimize the amount of mathematical notation you use. (a) = { a,b } . ( ab + ba ) * (b) = { a,b } . (( a * ) b ( a * ) b ( a * )) * b (c) = { a,b,c } . (( + a + aa + aaa )( b + c )) * ( + a + aa + aaa ) 2. Intersect 'em [ Category : Construction, Points...
View Full
Document
 Spring '10
 kuma

Click to edit the document details