Code: 13A05404 R13

B.Tech II Year II Semester (R13) Supplementary Examinations May/June 2017

FORMAL LANGUAGES & AUTOMATA THEORY
(Computer Science & Engineering)
Time: 3 hours Max. Marks: 70

PART - A
(Compulsory Question)
*****
1 Answer the following: (10 X 02 = 20 Marks)
(a) List and explain the components of finite state automat.
(b) Show the elimination of unit productions with an example.
(c) Differentiate between DFA and NFA with examples.
(d) What are context sensitive languages? Write one example.
(e) How to remove ambiguity from grammars? Explain with an example.
(f) Differentiate Chomsky and Greibach normal forms.
(g) Give the formal definition of a PDA.
(h) What is two-way DFA? Give its advantages of DFA.
(i) Differentiate between PDA and TM with respect to: halt state and final state.
(j) Justify the role of checking of symbols in a Turing machine.

PART - B
(Answer all five units, 5 X 10 = 50 Marks)
UNIT - I
2 (a) Design DFA which accepts even number of 0’s over {0, 1}.
(b) Design DFA which accepts language L = {100, 101}.
OR
3 Describe the following:
(a) Operations on sets.
(b) Relation and its properties.
(c) Prefix, suffix, concatenation, empty string.
(d) NFA with (Epsilon) moves.

UNIT - II
4 (a) State and prove Arden’s theorem.
(b) List the closure properties of regular languages.
OR
5 Construct FA for the following regular expressions:
(a) (0+1)* (1+00) (0+1).
(b) 0+10* + 01*0.
Contd. in page 2

Page 1 of 2
Code: 13A05404 R13

UNIT - III
6 Convert the following context free grammar to Greibach normal form:

P is

OR
7 (a) Find the grammar for the language .
(b) Write and explain closure properties of CFL’s.
UNIT - IV

8 Design DPDA for language .

OR
9 Convert the following context free grammar to push down automata:

UNIT - V
10 Design a Turing machine over to accept the language .
OR
11 Design a Turing machine to recognize the language .

*****

Page 2 of 2
Code: 15A05404 R15
B.Tech II Year II Semester (R15) Supplementary Examinations December 2017
FORMAL LANGUAGES & AUTOMATA THEORY
(Computer Science & Engineering)
Time: 3 hours Max. Marks: 70
PART - A
(Compulsory Question)
*****
1 Answer the following: (10 X 02 = 20 Marks)
(a) Define symbol, string and language.
(b) Differentiate between DFA and NFA.
(c) Draw DFA that accepts strings which has a substring of 101 over an alphabet {0, 1}.
(d) Differentiate between left and right linear grammars.
(e) Justify the statement CFLs are note closed under intersection with an example.
(f) Draw derivation tree for the string id+id* id from the grammar id.
(g) Formally define a push down automata.
(h) Briefly explain when we call a CFG is in Chomsky’s normal form.
(i) List the closure properties of recursive languages.
(j) Briefly explain the functioning of a counter machine.

PART - B
(Answer all five units, 5 X 10 = 50 Marks)
UNIT - I
2 Convert the following NFA with moves to NFA without moves.

2 3 4 5 6

10
1

7 8 9

OR
3 Construct a DFA for the regular expressions 10 + (0 + 11) 0*1 and optimize the states.

UNIT - II
4 Prove that is a perfect square is not a regular language using pumping lemma.
OR
5 List and explain the closure properties of regular languages.
Contd. in page 2

Page 1 of 2
Code: 15A05404 R15

UNIT - III
6 (a) Simplify the following grammar.

(b) Remove left recursion from the grammar

OR
7 (a) Define Ambiguous grammar.
(b) Remove ambiguity from the grammar .

UNIT - IV
8 Construct a pushdown automaton that recognizes even length palindromes over an alphabet {0, 1}.
OR
9 Construct a PDA that recognizes strings which contain equal number of 0’s and 1’s.

UNIT - V
10 Construct a Turing machine which multiplies two unary numbers.
OR
11 (a) Define the Turing machine Halting problem.
(b) Define the post correspondence problem.
Let and take A and B as .
Give a PCP solution for this problem. If we take
. Then, is there PC solution exist. Justify your answer.

*****

Page 2 of 2
Code: 15A05404
R15
B.Tech II Year II Semester (R15) Regular Examinations May/June 2017
FORMAL LANGUAGES & AUTOMATA THEORY
(Computer Science and Engineering)
Time: 3 hours Max. Marks: 70
PART – A
(Compulsory Question)
*****
1 Answer the following: (10 X 02 = 20 Marks)
(a) Define a DFA formally.
(b) Differentiate between a Moore machine and a mealy machine.
(c) What are various forms in which we can represent regular languages?
(d) Construct a DFA that accepts strings which does not contain a substring of 110.
(e) State and prove ARDEN’s theorem.
(f) When do we say a CFG is in Greibach Normal Form?
(g) Compare and contrast DPDA and NPDA.
(h) State the properties of LR grammars.
(i) Write short notes on Linear Bounded Automata.
(j) List the closure properties of Recursively Enumerable Languages.

PART – B
(Answer all five units, 5 X 10 = 50 Marks)
UNIT – I
2 Convert the following mealy machine into its equivalent Moore machine.
From state i/p To state o/p i/p To state o/p
Q0 0 Q1 N 1 Q3 N
Q1 0 Q2 N 1 Q3 N
Q2 0 Q2 Y 1 Q3 N
Q3 0 Q1 N 1 Q4 N
Q4 0 Q1 N 1 Q4 Y
OR
3 Minimize the following automata.

UNIT – II
4 Prove that the language p is a prime number is not regular.
OR
5 (a) Explain how equivalence between two FA is verified with an example.
(b) What are the applications of regular expressions and finite automaton?
Contd. in page 2

Page 1 of 2
 Code: 15A05404
R15

UNIT – III
6 Convert the following grammar into Greibach Normal form:

OR
7 Explain the closure properties of Context Free languages.
UNIT – IV
8 Construct a PDA that recognizes balanced parentheses.
OR
9 Construct a PDA that recognizes strings of type aibjci+j.
UNIT – V
10 Construct a Turing machine which carries out proper subtraction (a-b=0, if a<b).
OR
11 (a) Explain Chomsky Hierarchy of languages.
(b) Explain any four variations of Turing machines.

*****

Page 2 of 2
 Code: 13A05404 R13
B.Tech II Year II Semester (R13) Supplementary Examinations December 2017
FORMAL LANGUAGES & AUTOMATA THEORY
(Computer Science & Engineering)
Time: 3 hours Max. Marks: 70
PART – A
(Compulsory Question)
*****
1 Answer the following: (10 X 02 = 20 Marks)
(a) Explain the mathematical representation of finite state machine.
(b) List the advantages of non-deterministic finite automata.
(c) Write the procedure to remove the unit productions in CFG.
(d) What is left recursion? How to eliminate the left recursion?
(e) Write and explain the properties of regular sets.
(f) Obtain the regular expression to accept strings of a’s, b’s and c’s such that fourth symbol from the right is
a and ends with b.
(g) Give the differences between a PDA and a FA.
(h) Define LR(0) grammars.
(i) State and explain Rice theorem.
(j) What is an infinite loop in TM? Explain with an example.

PART – B
(Answer all five units, 5 X 10 = 50 Marks)
UNIT – I
2 Design DFA for the following over {0, 1}.
(i) All string containing not more than three 0’s.
(ii) All strings that has at least two occurrences of 1 between any two occurrences of 0.
OR
3 (a) Construct an NFA equivalent to the regular expression 1*0+1101 and (0+1)*.
(b) What are the different classes of automata? How they are classified? Explain in detail.
UNIT – II
4 (a) What are the different types of languages in automata theory? Clearly give the rules for each of these
languages and the relationship among these languages.
(b) Write regular expression for the language over {0, 1}: the set of all strings that contain 100.
OR
5 Construct FA for the following regular expressions:
(i) (0+1)* (1+00) (0+1)*
(ii) 0+10* + 01*0
UNIT – III
6 (a) What is normalization of CFG? What is the use of normalization? What are the different normal forms?
Explain.
(b) Convert the given CFG into GNF.

OR
7 (a) Find the grammar for the language .
(b) Write and explain closure properties of CFL’s.
Contd. in page 2

Page 1 of 2
 Code: 13A05404 R13

UNIT – IV
8 Design DPDA for language .
OR
9 Construct PDA’s that recognizes the languages: .
UNIT – V
10 (a) Design A Turing machine to recognize the language .
(b) Explain about undecidable problem.
OR
11 (a) What is a modified PCP? Explain with some suitable example.
(b) Give solution to the following PCP, if exists.
W = (00, 001, 1000) X = (0, 11, 011)

*****

Page 2 of 2