Scribd
Upload
101 views2 pages

BCS503

Uploaded by

Lalita Devi
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
101 views2 pages

BCS503

Uploaded by

Lalita Devi
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/ 2

Max Time Allowed: 3.00 Hrs. / 180 minutes.

Name ____________________
Max Marks: 60 Regd. No _________________

B.Tech. Cyber Security –5th Semester

END SEMESTER EXAMINATION -2021(ODD SEMESTER)

Formal Language & Automata Theory, BCS503

Instructions: Part A is Compulsory. In Part B, attempt one question from each unit.

PART A

1.
i. Give the applications designed as finite state system.
ii. Define: Finite Automaton(FA)
iii. Construct a regular expression for the language which accepts all strings with at least two
c’s over the set Σ={c,b}.
iv. What are the applications of Context free languages?
v. What are the three ways to simplify a context free grammar?
vi. What is a parser?
vii. Name the properties for which regular language is closed.
viii. Regular expression for the language that accepts all strings in which ‘a’ appears tripled
over the set Σ = {a}.
ix. What are the components of PDA?
x. What are the applications of TM?
2 X 10 = 20

PART B

UNIT I

2. Define grammar? Explain the Chomsky hierarchy of languages in detail.

OR

3. Find a grammar that generates

L={an bn+1 : n>=0}

Explain with diagram Chomsky hierarchy of languages.

1 X 10 = 10

EO-211224| Page 1 of 2
UNIT II

4. Define Transition Diagram. State the pumping lemma for regular languages. Give one
example for the same.

OR

5. Differentiate between NFA and DFA. Also explain Closure properties with suitable
examples. Design DFA to accept strings over ∑ = (0, 1) with two consecutive 0’s.

1 X 10 = 10

UNIT III

6. State the pumping lemma for context free languages and proof it with any example.
Consider the following grammar G with productions

S→ ABC | BaBA→aA|BaC|aaa

B→bBb|aC→CA|AC

Give a CFG with no useless variables that generates the same language.

OR

7. Categorize various types of language accepted by a PDA and define them? Convert the
following grammar G in greibach normal form:
S→ABb|aA→aaA|BB→bAb

1 X 10 = 10

UNIT IV

8. Design a Turing machine with no more than three states that accepts the language a(a+b)*.
Assume∑ = {a,b}. Also explain Halting problem in Turing machine.
Or
9. Explain the Church-Turing Thesis. Also explain Undesirability and decidability.

1 X 10 = 10

*********GNA UNIVERSITY**********

EO-211224| Page 2 of 2

You might also like