BITH311 - ELEMENTS OF COMPUTER SCIENCE THEORY

Assignment one

Lecturer Name: Kudzanayi Tavirimirwa

Contact: 0773084922

1. a) What is the definition of Algorithm according to Theory of Computation? [5]

b) Halting Problem is classified as which problem? Give reasons for your answer
[5]

c) Which computation model is used to decide if a string in a Context Sensitive Language? [5]

d) What is the Language accepted by a Turing Machine. Explain your answer [5]

2. a) In Theory of Computation, it is proved that Quantum Computer is same as Modern Electrical

computers. Which model is stronger than current computers? [10]

b) Explain theory of computation [10]

c) Is Deterministic Finite Automata (DFA) is same as Nondeterministic Finite Automata (NFA) [5]

d) Explain complexity, automata and computational theory giving examples [15]

3. For each of the following languages L, state whether it is regular or not and prove your answer.

(a) {x#y: x, y ∈ {0, 1}*, when viewed as binary numbers, x+y = 3y}. Example: 1000#100 ∈ L. [5]

(b) Let Σ = {a, b}. L = {w ∈ Σ*: (w contains the substring ab) → (w contains the substring ba)} [5]

(c) {w = xyzy : x, y, z ∈ {0, 1}+}. [5]

(d){w = st : s ∈ {a, b}* and t ∈ {b, c}* and #b(s) = 2⋅#a(s) and #c(t) = 3⋅#b(t)}.[5]
4. Show a (possibly nondeterministic) FSM that accepts {w ∈ {a, b}* : w contains at least one
instance of aaba, bbb or ababa}. [20]

Total 100