Reference no: EM133124117
CSC 420 Theory of Computation - University of Tabuk
Question 1: Give DFAs for the following languages over the alphabet is Σ = {a, b}
1) The language L(RE = b*a(ab)*b).
2) The language {w ∈ Σ* | w starts with ab}.
Question 2:
Convert the following CFG into an equivalent CFG in Chomsky Normal Form (CNF) over the
Σ = {a, b}.
S → aS |bbX
X → aaX| bY | ε
Y → aX
Question 3:
Consider the following CFG over {0,1}:
S → 0S | 0X
X → 11X | ε
1) What is the regular expression (RE) accepted by this CFG?
2) Show that whether this CFG is ambiguous or not:
3) Show that whether the word "01111" is accepted or not by this CFG:
4) Convert this CFG into PDA.
Question 4: Consider the following language:
L1 = L(re=0100*)
a) Build a deterministic pushdown automata (PDA) that recognizes this language L1 over the Σ = {0, 1}.
b) Build a Turing Machine(TM) that recognizes this language L1 over the Σ = {0, 1}.