Scribd
Upload
10 views

Automata(2020)

The document outlines the examination structure for the U.G. 5th Semester in Computer Science, focusing on the Theory of Computation. It includes various questions related to regular expressions, grammar, finite automata, and Turing machines, divided into three groups with specified marks. Candidates are instructed to provide answers in their own words and demonstrate understanding of key concepts in the field.

Uploaded by

ronnyhalder007
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Automata(2020)

The document outlines the examination structure for the U.G. 5th Semester in Computer Science, focusing on the Theory of Computation. It includes various questions related to regular expressions, grammar, finite automata, and Turing machines, divided into three groups with specified marks. Candidates are instructed to provide answers in their own words and demonstrate understanding of key concepts in the field.

Uploaded by

ronnyhalder007
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

572/Comp. Sc. UG/5th Sem/COM.SC-H-CC-L-511/20 h) Give example of NULL and UNIT productions.

i) Describe the following set by Regular


U.G. 5th Semester Examination - 2020
Expression {1, 11, 111, 1111...}.
COMPUTER SCIENCE
[HONOURS] j) Define grammar and language.
Course Code : COM.SC-H-CC-L-511 k) Why non-terminal symbols are important?
(Theory of Computation)
1) Differentiate between alphabet and string with
Full Marks : 60 Time : 24 Hours
respect to finite automata.
The figures in the right-hand margin indicate marks.
m) Write a regular expression for the language over
Candidates are required to give their answers in their
own words as far as practicable. the set = ={a, b} in which total number of a's
are divisible by 4.

GROUP-A n) What language will be generated by {S —SaS;


A—Db}? Justify.
1. Answer any ten questions: 2x10=20

a) Define Regular expression.


GROUP-B
b) What are type-1 grammar?
2. Answer any four questions: 5x4=20
c) When do you say a grammar is ambiguous?
a) Prove that the following language is not regular.
d) Construct regular expression for the language
_ I
that consists of all strings ending with 10. L={0"|n>1}
Assume £=1{0,1}.
b) Explain about the closure properties of CFL.
e) Differentiate between NFA and DFA. c) Construct a DFA that accepts all strings over
f) State Arden's theorem. {0,1} except those containing the substring 101.

g) Why parse tree is useful?

[Turn over] 572/Comp. Sc. [

[N}
d) Find the sets represented by the following b) Minimize the finite automaton shown in the
grammars: figure below and show given and reduced one
are equivalent. 10
i) (a+Db) (aa+ab+bb+ba)

ii) (ab)*+ (a +ab")"

e) Find regular expression for the following —il


transition diagram:

c) Define Non-deterministic Turing machine.


Construct a Turing machine that recognizes the
language:

L= {ab%|n>0 }. 3+7=10

d) i) Derive any two representative strings with


minimum length 4 from following context
f) Write a note on Recursive Enumerable
free grammar. G= ( {S,A,B},{a,b},P.S)
Languages.
S—bA|aB
A > bAAaS|a
GROUP-C
B—aBB|bS|b
3. Answer any two questions: 10x2=20
ii) Draw derivation tree corresponding to
a) Prove that if L is a regular language then L® is
string aabbab with respect to
also a regular language. Convert the grammar
aforementioned grammar. 4+6=10
S—0Sl1|A; A—1A0|S|e into PDA that
accepts the same language. Check whether the
string 1101 belongs to N(M). 4+5+1=10

572/Comp. Sc. [3] [Turn over] 572/Comp. Sc. [4]

You might also like