This preview shows page 1. Sign up to view the full content.
Unformatted text preview: c â€™s. It is possible that there are no a â€™s, b â€™s or c â€™s. However, Î» is not in the set. ( a + b * c * ) âˆª ( a * b + c * ) âˆª ( a * b * c + ) 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 . a ( a âˆª c ) * b ( a âˆª c ) * b ( a âˆª c ) * 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 . Let the strings without ab be w = b * ( a âˆª cb * ) * . Then the desired set is ( wabwab ) * wabw...
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.
 Spring '11
 JOE

Click to edit the document details