Scribd
Upload
43 views

w-2022

This document is an examination paper for the Theory of Computation course at Dr. Babasaheb Ambedkar Technological University, Lonere, for the Winter Examination 2022. It includes instructions for students and a series of questions categorized by course outcomes, covering topics such as finite automata, context-free grammars, pushdown automata, and Turing machines. The exam consists of five questions, each requiring the solution of two sub-questions, with a total of 60 marks available.

Uploaded by

pratusathe16
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
43 views

w-2022

This document is an examination paper for the Theory of Computation course at Dr. Babasaheb Ambedkar Technological University, Lonere, for the Winter Examination 2022. It includes instructions for students and a series of questions categorized by course outcomes, covering topics such as finite automata, context-free grammars, pushdown automata, and Turing machines. The exam consists of five questions, each requiring the solution of two sub-questions, with a total of 60 marks available.

Uploaded by

pratusathe16
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

DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE


Winter Examination – 2022
Course: B. Tech. Branch : IT Semester :V
Subject Code & Name: Theory of Computation(BTITOE504A)
Max Marks: 60 Date:08/02/2023 Duration: 3 Hr.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/CO) Marks
Q. 1 Solve Any Two of the following. 12
A) Construct a nondeterministic finite automaton (without ∈ -transitions) that CO1 6
accepts the language of the following regular expression:
(1+110)*0
Transform obtained nondeterministic finite automaton to an equivalent
deterministic finite automaton that accepts the same language.

B) Explain the steps required to obtain a DFA from nondeterministic finite CO1 6
automaton.

C) Transform the following nondeterministic finite automaton into an CO1 6


equivalent deterministic finite automaton.
a b
→ p {p, q} {p, t}

q {r} ∅

r {s} ∅

*s {s} {s}

t ∅ {s}

Q.2 Solve Any Two of the following. 12


A) Prove that the language of balanced parenthesis strings { (), (()), (()(())), . ..} CO2 6
is not regular.

B) Write a note on pumping lemma for regular language. CO2 6

C) Construct a regular expression for the language containing strings made up CO2 6
of 0’s and 1’s such that each string contains at least two 0s and at least one
1.
Also construct the ∈-NFA for the language.

Q. 3 Solve Any Two of the following. 12


i j k
A) Represent the language L= { 0 1 0 | j > i + k } using CFG. CO3 6
B) Give the steps required to convert a CFG into CNF. Express the following CO3 6
grammar using CNF
S  ABA
A aA | ε
B bB | ε

C) Write a note on pumping lemma for context-free-grammar. CO3 6

Q.4 Solve Any Two of the following. 12


A) Explain the equivalence between PDA and CFG. CO4 6

B) Design the DPDA for the language : S SS | {S}| [S] | ε CO4 6

C) Give the formal definition of PDA and design a PDA for accepting the CO4 6
language of palindromes over {a, b}.

Q. 5 Solve Any Two of the following. 12


A) Design a Turing Machine for accepting the language L ={ ss | s Є {a, b}* } CO5 6

B) Give the formal definition of Turing machine and design the Turing CO5 6
i j
Machine for the language {0 1 | i = j }. Also give the ID conversion for the
string 0011.

C) Design a TM for monus or proper subtraction i.e. m - n = max(m-n , 0). CO5 6


*** End ***

You might also like