CS F351 Theory of Computation

Tutorial-3

Problem 1 Construct an equivalent DFA for the following NFA's.

1. ({q0 , q1 , q2 , q3 }, {0, 1}, δ, q0 , {q3 }) where δ is

given in the below table.
δ 0 1
→ q0 {q0 , q1 } {q0 }
q1 {q2 } {q2 }
q2 {q3 } ∅
q3 {q3 } {q3 }

2. ({q0 , q1 , q2 , q3 }, {0, 1}, δ, q0 , {q1 , q3 }) where δ

is given in the below table.
δ 0 1
→ q0 {q1 , q3 } {q1 }
q1 {q2 } {q1 , q2 }
q2 {q3 } {q0 }
q3 ∅ {q0 }

Problem 2 Design an NFA with ϵ transition for the following languages.

(a) A = {xwxR ∈ {0, 1}∗ | x, w ∈ {0, 1}∗ and are of non-zero length}.
(b) B = {w ∈ {a, b}∗ | w = aba or |w| is even}.
(c) A = {w ∈ {a, b, c}∗ | there is a symbol in {a, b, c} that is not appearing in w}.

Problem 3 Show that any nite language over any (nonempty) alphabet Σ is regular.