Q1. Give a simple verbal description of the language
Q2. Write regular expressions for the following languages on ?
= {a, b, c}:
a) All strings containing no more than three b's.
b) All strings that contain at least one occurrence of each
symbol in ?.
Q3. For ? = {a,b}, construct dfa's that accept the sets
consisting of
a. all strings with an even number of a's and an odd
number of b's.
Q4. Given the language L denoted by
r = (a+b)*. (aa*+b) and, ? = {a,b} and [] = {c,d,x}
h(b) = xd,
h(a) = cdx
please provide the homomorphic image of the regular expression
h(r)
