Assignment #4

n Find an NFA that accepts the language L(a(a+b)a*)

n Give REs for the following languages on Σ = {a, b, c}.
q All strings containing exactly two a’s
q All strings containing no more than three a’s
n Give REs for the following languages on Σ = {0, 1}.
q All strings ending in 01
q All strings not ending in 01
n Find DFAs that accept the following languages.
q L((a+ab)* (a+aa))
q L = L(ab*a*) U L((ab)*ba)
n Due: Next week at the beginning of the class

SC6202 Computability, Complexity and Algorithms 37