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
This note was uploaded on 02/22/2012 for the course CS 480 taught by Professor John during the Spring '12 term at Michigan State University.
 Spring '12
 JOHN

Click to edit the document details