Scribd
Upload
54 views12 pages

Atfl

This document provides the details of an examination for an Automata Theory and Formal Languages course, including the course objectives covered, questions to be answered, and details of the exam structure. The exam consists of 10 short answer questions that must be answered, along with choosing one question from each of the 4 units. The questions cover topics such as the definitions of DFAs, NFAs, regular expressions, pumping lemma, context-free grammars, pushdown automata, Chomsky normal form, Turing machines, and more. Students are asked to complete tasks like draw automata, prove statements, write derivations, and convert between models of computation.

Uploaded by

sujeen killa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
54 views12 pages

Atfl

This document provides the details of an examination for an Automata Theory and Formal Languages course, including the course objectives covered, questions to be answered, and details of the exam structure. The exam consists of 10 short answer questions that must be answered, along with choosing one question from each of the 4 units. The questions cover topics such as the definitions of DFAs, NFAs, regular expressions, pumping lemma, context-free grammars, pushdown automata, Chomsky normal form, Turing machines, and more. Students are asked to complete tasks like draw automata, prove statements, write derivations, and convert between models of computation.

Uploaded by

sujeen killa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

18CS502

Hall Ticket Number:

III/IV B.Tech(Regular) DEGREE EXAMINATION


February, 2021 CSE
First Semester Automata Theory and Formal Languages
Time: Three Hours Maximum:50 Marks
Answer Question No.1 compulsorily. (10X1 = 10 Marks)
Answer ONE question from each unit. (4X10=40 Marks)

1. Answer all questions (10X1=10 Marks)


a) Give formal definition of DFA. CLO-1 1M
b) Define epsilon closure of the state. CLO-1 1M
c) What is the use of epsilon moves? CLO-1 1M
d) Define regular language and regular expression. CLO-2 1M
e) List out closure properties of regular languages. CLO-2 1M
f) State pumping lemma for regular languages. CLO-3 1M
g) Give formal definition of CFG. CLO-3 1M
h) Give formal definition of PDA. CLO-4 1M
i) Define CNF. CLO-4 1M
j) Give formal definition of Turing machines. CLO-4 1M
UNIT I
2. a) Construct DFA that accepts the language which contains any number of a’s followed by at 5M
least 2 b’s followed by exactly 3 c’s followed by at most 2 d’s. CLO-1
b) Prove that if L is accepted by NFA then there is DFA that accepts same language L. CLO-1 5M

(OR)
3. a) Convert the following NFA to DFA CLO-1 6M

b) Construct NFA that accepts the language which contains set of strings with 10th symbol 4M
from the left end is 1 and 8th symbol from the left end is 0. CLO-1
UNIT II
4. a) Find out the regular expression represented by the following DFA by using transitive 5M
closure method. CLO-2
b) Give epsilon NFA for the regular expression (abb+ba)(a+b)* . CLO-2 5M
l(OR)
Prove that L={an bn | n≥0 } is not regular. CLO-2
5. a) 4M
b) Give regular expressions for the following languages. CLO-2 6M
i. Set of strings contains any number of a’s followed by at least one b followed by
exactly 2 c’s.
ii. Set of strings contains even number of a’s followed by odd number of b’s
iii. Set of strings end with 10.

UNIT III
Give left most and right most derivations of the string “aabbabba” to the following 5M
6. a) grammar CLO-3
S  aB | bA
A a | aS | bAA
B  b | bS | aBB
b) Convert the following grammar to PDA. CLO-3 5M
I  a | b | Ia | Ib | I0 | I1
E  E+E | E*E | (E) | I

(OR)
7. a) Construct CFG for the language L = { aibjck | i=j or j=k } CLO-3 5M
b) Construct PDA to accept the language L ={ wcwR | w{a,b}*}
CLO-3 5M
UNIT IV
8. Convert the following grammar into CNF. CLO-3 10
S  AACD M
A  aAb | 
C  aC | a
D  aDa | bDb | 

5M
(OR)
a) Write short notes on closure properties and decision properties of CFLs. CLO-4
9. 4M
n n n
b) Construct Turing machine to the language L = { a b c | n>0} 6M
CLO-4

You might also like