loading...

CS402 Theory of Automata Assignment 2 Solution Fall 2014

Q.1: Consider the following Regular Expression (RE):

zx(y + z)* x (x + y+ z)*y + zy(x + z)* x (x + y+ z)*y + zz(x + y)* x (x + y+ z)*y

Draw transition graph for the above RE.                                                                  [Marks 4]

Q.2: Consider the following languages defined over Σ = {a, b}         

L1={^,aa, bb}

L2={a, b, ab}

a)     Draw Finite Automaton (FA) for L1 and L2.

b)     Draw FA for the concatenation of  L1 and L2

[Marks 3+3+10]

DOWNLOAD SOLUTION HERE
loading...