Scribd
Upload
130 views2 pages

Theory of Computation

Uploaded by

arkatkar
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
130 views2 pages

Theory of Computation

Uploaded by

arkatkar
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


Supplementary Summer Examination – 2023
Course: B. Tech. Branch :Computer Engineering Semester :V
Subject Code & Name: Theory Of Computation (BTCOC502)
Max Marks: 60 Date:09/08/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 Deterministic Finite Automaton for the set of string over Design 6
{a, b} such that length of the string |w|=2.
B) State and explain applications of Regular Expressions. Understand 6
C) Design an NFA with ∑ = {0, 1} accepts all string ending with 01. Design 6

Q.2 Solve Any Two of the following. 12


A) Distinguish between Moore machine and Mealy machine . Analyze 6
B) Write a regular expression over alphabet ∑ = {0, 1} for following . Create 6
(i) begins with 1, ends with 1 (ii) ends with 00 (iii) contains at least three
consecutive 1s
C) Convert the following Non Deterministic Automaton into Deterministic Apply 6
Finite Automaton .

Q. 3 Solve Any Two of the following. 12


A) Write the steps for grammar reduction. Eliminate Unit Productions from the Apply 6
following grammar.

S -> Aa|B|c
B -> A|bb
A -> a|bc|B
B) Explain Chomsky classification of grammar. Remember 6
C) When does context free grammar is said to be in Chomsky Normal Understand 6
Form(CNF)? Write steps to convert context free grammar into CNF.

Q.4 Solve Any Two of the following. 12


A) Write the productions rule of Context free grammar for following regular Design 6
expressions. (i) 0* (ii) (a+b)* (iii) (ab)*
B) What are the different components of Pushdown Automaton? Explain with Remember 6
neat diagram.
C) Distinguish between Deterministic and Non Deterministic PDA. Analyze 6

Q. 5 Solve Any Two of the following. 12


A) Design Turing machine that accepts the language of all strings over alphabet Design 6
∑ = {a, b} whose second letter is b.
B) Explain the following (i)Multihead Turing machine (ii)Universal Turing Understand 6
machine (iii) Non Deterministic Turing machine
C) What is Church Turing Thesis ? Explain. Remember 6
*** End ***
The grid and the borders of the table will be hidden before final printing.

You might also like