[Dec-22]

GITAM (Deemed to be University)

[19ECB201]
B.Tech. Degree Examination
Computer Science & Business System (CSBS)
III Semester
FORMAL LANGUAGE AND AUTOMATA THEORY
(Effective from the admitted batch 2021–22)

Time: 3 Hours Max.Marks: 60

---------------------------------------------------------------------------------------------------
Instructions: All parts of the unit must be answered in one place only.
Figures in the right hand margin indicate marks allotted.
---------------------------------------------------------------------------------------------------
SECTION-A
1. Answer All the Questions: 102=20M
a) What is DFA? Explain with an example.
b) Design a DFA to accept the language
L = { w: na(w) >= 1, nb(w) = 2}
c) List any four closure properties of regular sets.
d) Obtain RE over {a,b} such a way that always third symbol from right
side is „a‟ and forth symbol is „b‟
e) Explain the tuples in Push down automata.
f) Using the following grammar
{E→E+E |E*E | id}, construct parse tree for the string “id * id + id”
g) Design a Turing machine for 1‟s complement of a binary number.
h) Give any two examples of recursively enumerable languages
i) Define Universal language.
j) Define P Versus NP problem.
SECTION-B
Answer the following: 5x8=40M
UNIT-I
2 Explain the construction steps involved in converting an NFA to DFA.
OR

Page 1 of 3
3. Design a DFA that accept the language over the alphabet, ∑ = {0, 1, 2}
where the decimal equivalent of the language is divisible by 3.

UNIT-II

4. Use pumping lemma to show that each of the following language is not
regular:
i) L={anbn| n>=0}
ii) L={aibi|i<=j}
OR
5. Obtain the regular expression for the given finite automata using Arden‟s
theorem

UNIT-III
6. Write the closure properties of Context Free Languages
OR

7. Consider the following grammarG:

{S ->ASB|ε; A ->aAS|a; B ->SbS|A |bb }
Find an equivalent grammar that has: no null productions, no unit
productions and no use less symbols one after the other.
UNIT-IV

8. Show that any non-trivial property of the recursively enumerable language

is undecidable.
OR

9. Design Turing Machine which will recognize strings containing equal

number of 0‟s and 1‟s.
UNIT-V

Page 2 of 3
10. Explain Church-Turing thesis in detail.
OR

11. Write the differences between P and NP completeness.

[3/I S/122]

Page 3 of 3