Assignment1
Assignment1
Assignment1
• Answer the questions below, showing all relevant work and the meth-
ods used to obtain your results. Answers may only be submitted as a
single PDF (.pdf ) file.
Question1: (10 marks) Determine if each of the following languages are regular.
Prove your answers by representing the language using a regular ex-
pression or NFA, or by using the pumping lemma.
[email protected] Page 1
INFO47546 Theory of Computation
a) NFA
b) DFA
c) CFG
d) PDA
S→B |C
A→e|v |i|l|s|
B → ABA | ε
C → DCE | v
D → le
E → el
[email protected] Page 2