Scribd
Upload
6 views4 pages

Automata 2023

The document outlines the examination structure for a Computer Science course on Theory of Computation, detailing the course code, full marks, and time allotted. It includes three groups of questions, with Group A requiring answers to ten short questions, Group B four longer questions, and Group C two in-depth questions. Topics covered include automata theory, regular expressions, grammar, decidability, and Turing machines.

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
6 views4 pages

Automata 2023

The document outlines the examination structure for a Computer Science course on Theory of Computation, detailing the course code, full marks, and time allotted. It includes three groups of questions, with Group A requiring answers to ten short questions, Group B four longer questions, and Group C two in-depth questions. Topics covered include automata theory, regular expressions, grammar, decidability, and Turing machines.

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/ 4

641/Comp.Se. UG/SL Sem/COM.

SCHCCL5TH23

U.G Sh Semester Examination - 2023


COMPUTER SCIENCE
|ONOURS.
Course Code : COM.SsC-HCCL-511
(Theoryof Computation)
Full Marks : 60 Time : 24 Hours
The figures in the right-hand margin indicate marks.
Candidates are required to give their answers
their own words as far as practicable.

GROUP-A

Answer any ten questions: 2x10-20


1.
Write two applications of automata theory.
b) Compare the transition functions of NEA and
DEA.
c) Describe the following set by Regular
Expression (00,1010,110110,1|10110,..).
d) Define regular grammar with suitable example.
e) How many strings of length 3 are described by
the following regular expression: (01+10)*
) What is the role of the stack in a pushdown
automaton (PDA)?

g) Differentiate between regular languages and


context-free languages.

(°n Over)
Construct regular expression for the language
thatconsists of all strings ending with 01 or 10,
Assume S (0,1).
i) What is the main purpose of the transition
function in anautomaton?
i) State Arden's thcorem.
What is the difference between a decider and a
recognizer in the context of Turing machines?
What is the significance of the concept of
closure in formal languages?
Which of the pair (r,, ) and (r,, r) of the
following regular expressions are equivalent?
-Justity.
(ab)*c and r; atb*c, ry (atb) and ra a*b
n) How does an NEA accept a string, and why might
it accepta string in multiple ways?
Differentiate between Null Transition and
e-transition.
GROUP-B
2. Answer any four questions: 5x4-20
a) Minimize the following DEA describing every
steps:

a,b

641/Comp.Sc. [2]
b) State pumnping lemma for the regular languages.
Prove that the following language is not regular.
Ly = (0" 1^ |n>0)
c) Illustrate the rightmost derivation of the string
id + id * id using the following grammar and
also state whether the given grammar is
ambiguous or
o not.
E’ E+E|E*E|(E) | id
d) Design a finite automaton for accepting all the
decimal numbers divisible by 3.
e) Define the concept of decidability in the context
of formal languages. Provide an example of a
language that is decidable and another example
that is undecidable.
f) Clearly mention the steps for converting a
context-free grammar (CFG) into Chomsky
Normal Form (CNF).
GROUP-C
3. Answer any two questions: 10x2-20
a) i) Convert the following NFA to its
equivalent DFA:

1/0 1/0 )1/0


1

1/0

641/Comp.Sc. [31 [Turn Over]


ii) Given the regular expression
R= (0*1* + 1* 0*)", create a regular
grammar G that generates the language
described by the regular expression.
Clearly define the production rules, start
symbol., and any additional necessary
components of the grammar. 5+5
List the closure properties of Recursive
Languages. Compare context sensitive grammar
and context free grammar with example. Can we
design a PDA for context sensitive language?
Justify your answer. 3+3+4

c) How does the Universal Turing machine


simulate other Turing machines? Design aTuring
machine that determines whether the binary
input string is of odd parity or not. 4+6

d) Explain the difference between Deternministic


and Non-deterministic Push down automata with
example. Design a PDA that recognizes the
following language:
Lz = {w | w contains balanced parentheses},
where the alphabet is {()} The PDA should
handle nested parentheses (e.g., (00) is
accepted, but)(is not). 4+6

641/Comp.Sc. [4]

You might also like