Scribd
Upload
19 views5 pages

Automata 2022

This document outlines the examination structure for the U.G 5th Semester in Computer Science, specifically for the Theory of Computation course. It includes three groups of questions, with Group A requiring answers to ten questions, Group B four questions, and Group C two questions, covering topics such as automata theory, grammars, and Turing machines. The exam is designed to assess students' understanding of theoretical concepts in computation and formal languages.

Uploaded by

ronnyhalder007
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
19 views5 pages

Automata 2022

This document outlines the examination structure for the U.G 5th Semester in Computer Science, specifically for the Theory of Computation course. It includes three groups of questions, with Group A requiring answers to ten questions, Group B four questions, and Group C two questions, covering topics such as automata theory, grammars, and Turing machines. The exam is designed to assess students' understanding of theoretical concepts in computation and formal languages.

Uploaded by

ronnyhalder007
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/ 5

674/Comp.Sc. UG/5th Sem/COM.

SC-H-CC-IL-511/22

U.G 5th Semester Examination - 2022

COMPUTER SCIENCE
[HONOURS
Course Code : COM.SC-H-CC-L-511
(Theory of Computation)
Full Marks 60 Time 2 Hours
The figures in the right-hand margin indicate marks.
Candidates are required to give their answers in
their own words as far as.practicable.

GROUP-A
1. Answer any ten questions: 2x10-20
a List some of the applications of automata
theory.
b) Why NFA is useful?
What are type-3 grammar?
Construct' regular expression for the language
that consists of all strings ending with 00.

Assume ={0, 1}.


When do you say a grammar is ambiguous?

List closure properties of context free language.

& State Arden's theorem.

/Turn Over
) What is derivation tree?
For a given language L, what is the operation
that is denoted as L*?

i) Describe the following set by Regular


Expression {0, 010, 01110, 0111110....
Which of the following pair of regular
expression are not equivalent?

r=1(01)* and (10)*1, r, =(ab)* and a*b*


1) What is the significance of non-terminalI
symbols?

m) Differentiate between sentence and sentential


form.
n) How many strings of length less than 4 contains
the language
described by the regular expression
(a+b)*b(xtxy)*?
If G is the
grammar having production rules
S SbS/a. Find a string for which G is
ambiguous.

674/Comp.Sc 21
GROUP-B

2 Answer any four questions: 5x4-20

State pumping lemma for the regular languages.


Prove that the following language is not regular:

L-{orn>o
bProve the equivalence of acceptance of a PDA
by final state and empty stack.

c Minimize the following DFA describing every


steps:

0,1
1

0
1

0
0,1
d)
d) Draw a DFA that recognize the language of all
strings of 0's and 1's of length at least 1 that, if
they were interpreted as binary representation
of integers, would represent evenly divisible by
3. Your DFA should accept the string 0 but no

674/Comp.Sc 13 /Turn Over]


Simulate the
other strings with leading 0's.
designed DFA with suitable string.
2 and Type
D e f i n e formally lype 0. Type 1, Type
3 grammar with examples.

be the FA in given fig below for


) Let M, and M,
the language L, and L Find L, uLy.

M- 0 B
1

(a)

0 0,1

M 0

(b)

674/Comp.Sc 141
GROUP-C

3. Answer any two questions: 10x2-200


a)Find a CFG without e-productions equivalent
to. the grammar defined by

SABaC, A->BC, B>b/e, C> D/e, D>d.

Construct Regular grammar for the regular


expression:
(a+ b)*(aa+ bb)(a + b)* 5+5

Compare and contrast recursive and recursively


enumerable languages. Briefly describe the
significance of halting problem. 5+5

Define Turing machine. Discuss about Multitape


Turing Machines. Explain informally how they
can simulate the moves of a Turing Machine.
3+2+5

d) Showthat thelanguage Lg=ww/wela, b}


is not a CFL. Design a CFG for the language
L={a'b'e li, j, k20, and i=j or i-k}
5+5

674/Comp.Sc [5]

You might also like