Scribd
Upload
11 views1 page

Cacsc10 CDCSC10 Cocsc10 CMCSC10 2024

This document outlines the examination structure for the Theory of Automata and Formal Languages course, including course codes, titles, and examination details. It presents a series of questions across multiple topics such as automata theory, grammar simplification, Chomsky hierarchy, pushdown automata, Turing machines, and language classifications. Students are required to attempt various parts of the questions, demonstrating their understanding of theoretical concepts and practical applications.

Uploaded by

shreya.singhug23
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
11 views1 page

Cacsc10 CDCSC10 Cocsc10 CMCSC10 2024

This document outlines the examination structure for the Theory of Automata and Formal Languages course, including course codes, titles, and examination details. It presents a series of questions across multiple topics such as automata theory, grammar simplification, Chomsky hierarchy, pushdown automata, Turing machines, and language classifications. Students are required to attempt various parts of the questions, demonstrating their understanding of theoretical concepts and practical applications.

Uploaded by

shreya.singhug23
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/ 1

Total no. ofrages:0l koll No .

FOURTH SEMESTER- B. TECH


END-SEMESTER EXAMINATION, April, 2024
Course Code: CACSCIO, CDCSCI0, COCSCI0, CMCSCIO
Course Title: Theory of Automata and Formal Languages
Time;3 hrs. Max.Marks:50
Attempt all questions. Missing data (if any), may be suitably assumed and mentioned in the answer.
-

QI Attempt any two parts of the following 5+5 COl,


a) What is Automata theory? What are different ways of describing the regular languages? C02
Find a regular expression to accept strings of a’s and b’s consisting of an .~ven number of
a’s, followed by at least one b, followed by zero or an odd number of a’s. Show steps also.
Convert the same to minimized DFA. -

b) What is Pumping Lemma for regular languages? Is language {uww’~v: Ii, v, w C (a, b}~’}
regular? Prove your answer.
c) 1) Explain the implementation of Theory of Automata and Formal languages in any real
application scenario.
ii) What is the difference between Moore and Mealy machine. Design a Moore machine
that gives 2’s cornplcment of the given input string.
Q2 Attempt any two parts of the following 5+5 Cal,
a) Simpli~, the following grammar: C02
5—, ASA/aB
A~B/5
B—b/s
Find Chomsky normal form for the simplified grammar. What is the difference between
Chomsky normal form and Greibach normal form.
b) What is Chomsky Hierarchy for grammars? For a system, password setting is required.
This is done under certain specific conditions, The password can be of arbitrary length but
must contain at least one letter {A-Z, a-z}, one number {0-9} and one special symbol {“
fi, 5, &, +}. Design CFG showing the given conditions, Prove whether the grammar
,~, ‘~,

is ambiguous or not for the input string pqA53#$.


c) Consider the language L = {athiek j i’c$k}
Is La context free language? If no, explain why. If yes, explain and write its CFG. Explain
how Context Free Languages are closed under Kleen closure operator.
Q3 Attempt any two parts of the following 5+5 C02,
a) Construct and explain the pushdown automaton accepting co~
L = {x’yiz” Ii, j, leo, i-l-k=j}.
b) Construct the CFG which accepts the push down automata defined as follows. Explain the
language represented by the CFG.
~(qo,a,Z)=(qo,~.z)
~(qo,a,A)=(qo,A)
ö(qo , b, A) = (qi, c)
ö(ql,€,Z)=(q2,s)
c) What is the difference betweun pushdown automata that accept by final state and
pushdown automata that accept by empty stack? Construct a PDA to accept the language
L={wIlmln>=1,m>c=I,ffl>fl÷2}
Q4 Attempt any two parts ofthe following
a) Design a Turing machine that accepts {O’1”2”J n≥1} and show moves for the input
001122.
b) Explain different variants of Turing machine with example.
c) Explain Universal Turing Machine in details.
Q5 Attempt any two parts of the following
a) What do you understand by recursively enumerable languages, how they are different
from recursive languages. Explain with the help of an example.
b) Explain Tractable and Intractable Problem each with an example. Explain a problem
which cannot be solved in polynomial time and why.
c) What is difference between decidable and undecidable problem. Explain whether Halting
problem is decidable or undecidable.

You might also like