(1)
Find Regular Expressions for the following languages.
(a) all strings containing no more than two 'a's, ? = {a, b, c}.
(b) all strings not ending in '10', ? = {0, 1}.
(2)
3.1.13
(P76 of Linz's book)
(3)
Find an NFA for
r=(b*ab*ab*)* + b*
(4)
Find an NFA without ?-transitions and with a single final state
that accepts the set {0} U {1<sup>N</sup>: N ? 1}.
(5) Construct a right-linear grammar for the language,
L = {a<sup>n</sup>b<sup>m</sup>: n ? 1, m ? 3}.