DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Regular/Supplementary Winter Examination – 2023
Course: B. Tech. Branch : Computer and Allied
Semester :V
Subject Code & Name: Theory Of Computation (BTCOC502)
Max Marks: 60 Date:03/01/2024 Duration: 3 Hrs.
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) Find the string set for following regular expressions. Create 6
(i)00* (ii)a*b* (iii) (0+1)*
B) What are the elements of Deterministic Finite Automaton? How it is Remember 6
represented?
C) Design Non Deterministic Finite Automaton that accepts set of all Design 6
strings over {0,1} that start with 0 or 1 and end with 01 or 10.

Q.2 Solve Any Two of the following. 12

A) Distinguish between Mealy machine and Moore machine. Remember 6
B) Apply subset construction algorithm to convert following Non Apply 6
Deterministic Finite Automaton to Deterministic Finite Automaton

C) Consider the following production rules. Apply 6

S aAB
AbBb
B A|ϵ
Obtain leftmost and rightmost derivation for string “abbbb”
Q. 3 Solve Any Two of the following. 12
A) Show that the given grammar is ambiguous grammar. Apply 6
E E+E
EE*E
Ea
B) Explain Chomsky classification of grammar. Remember 6
C) Find Context Free Grammar without ϵ- productions equivalent to the Apply 6
following grammar .
SABaC
ABC
Bb | ϵ
C D| ϵ
Dd

Q.4 Solve Any Two of the following. 12

A) Reduce the following grammar to Chomsky Normal Form(CNF). Apply 6
SaAD
AaB | bAB
Bb
Dd
B) Design Push down Automata (PDA) to accept language L=(a,b)* where Design 6
na= nb.
C) Distinguish between Deterministic and Non Deterministic PDA. Remember 6

Q. 5 Solve Any Two of the following. 12

A) What are the different components of Turing machine? Remember 6
B) What is halt state of Turing machine? Explain Church Turing thesis. Understand 6
C) Design Turing machine that erases all non-blank symbols from its tape . Design 6
*** End ***
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Supplementary Examination – Summer 2022
Course: B. Tech. Branch : CSE Semester :5th
Subject Code & Name: BTCOC502: Theory of Computations
Max Marks: 60 Date: 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. 2*6=
12M
A) Find DFA that accepts only the language of all strings with b 6M
as the second letter over the alphabet Σ={a,b}.

B) Construct a Mealy machine of the following Moore machine 6M

C) Construct the DFA for the following NFA 6M

Q.2 Solve Any Two of the following. 2*6=

12M
A) Explain Chomsky classification of grammars 6M
B) Consider the grammar given as G = ({S,A}, {a,b}, P , S ) 6M
Where production P consists of ,
 S→ aAS | a

A→ SbA | SS | ba

Find

a) Leftmost derivation
b) Rightmost derivation
c) Parse tree

for the string “ aabbaa ”.

C) Find a reduced grammar G to the grammar given below 6M

S→ AB|CA
A→ a
B→BC|AB
C→aB|b

Q. 3 Solve Any One of the following. 2*6=

12M
A) Convert the following CFG to CNF: 6M
S aSa| bSb | a | b | aa | bb

B) Obtain RLG from the given Finite Automata 6M

C) For the grammar given find L(G ) 6M

S → a │ Sa │ b │ bS .

Q.4 Solve Any Two of the following. 2*6=

12M
A) Construct a PDA accepting L = { an bm an |m, n ≥1} by a null 6M
stack. Is it deterministic?
B) Construct a PDA equivalent to the following context free grammar 6M
S→aAA
A→aS|bS|a
 C) Let M = ( { q0 , q1} , { 0 , 1}, { X , Z0} ,  , q0 , Z0 , } 6M
where is given by
( q0 , 0 , Z0) ={ (q0 ,X Z0) }
( q0 , 0 , X) = { (q0 ,X X) }
( q0 , 1 , X) = { (q1 ,  ) }
( q1 , 1 , X) = { (q1 ,  ) }
( q1 ,  , X) = { (q1 ,  ) }
( q1 ,  , Z0) = { (q1 ,  ) }

Construct a CFG

Q. 5 Solve Any One of the following. 2*6=

12M
A) Obtain a Turing machine to accept the language 6M
L= { 0n1n 2n | n≥ 1}.

B) Design a TM to find one’s complement of the binary number. 6M

C) Explain the following 6M
1)Turing Machine with stay-option
2) Multiple Tapes Turing Machine

*** End ***

The grid and the borders of the table will be hidden before final printing.
 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.
 DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Winter Examination – 2022
Course: B. Tech. Branch: Computer Science & Engineering Semester: V
Subject Code & Name: BTCOC502 Theory of Computation
Max Marks: 60 Date: 31-01-2023 Duration: 3 Hrs

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) Explain in brief FSM Properties and Limitations? Write Applications of Understand / 6
FSM?
CO-1
B) Construct Mealy Machine for the given Moore Machine? Apply/ CO-2 6
Present state Next State Output
a=0 a=1
→q1 q1 q2 0
q2 q1 q3 0
q3 q1 q3 1

C) Understand/ 6
Design a FSM to check whether a given decimal number is divisible by 5?
CO-1

Q.2 Solve Any Two of the following. 12

A) Explain in brief Chomsky hierarchy with suitable examples? Understand / 6
CO-2
B) Apply / CO-3 6
Eliminate NULL production from the grammar G given below:
a. S→ a / Xb / aYa
b. X→ Y / ^
c. Y→ b / X

Write the productions after elimination.

C) Check whether the given grammar is ambiguous or not- Analyse / 6
a. S → a / abSb / aAb CO-3

b. A → bS / aAAb

1
Q. 3 Solve Any Two of the following. 12
A) Consider a left linear grammar as given below − Apply / CO-3 6
a. S→ Sa|Abc
b. A→ Sa|Ab|a

Convert left linear grammar to right linear grammar.

B) Convert the given to context free grammar to CNF forms Apply / CO-3 6
a. S → ASB
b. A → aAS|a|ε
c. B → SbS|A|bb
C) Derive a derivation tree for the string aabbabba for the given context free Analyse / 6
grammar (CFG) −
CO-3
a. S->aB|bA
b. A->a|aS|bAA
c. B->b|bS|aBB

Q.4 Solve Any Two of the following. 12

A) Define a PDA & list three important properties of a PDA Machine? Understand / 6
CO-2
B) Construct a PDA to check well formedness of parenthesis? Create / CO-3 6
C) Convert the following grammar to a PDA that accepts the same language. Apply / CO-3 6

a. S → 0S1 | A
b. A → 1A0 | S | ε

Q. 5 Solve Any Two of the following. 12

A) Design a TM for an equal number of a’s and b’s must follow a. Create / CO-3 6
B) Design a TM which recognizes palindromes over = {a, b} Create / CO-3 6
C) Explain ‘Halting Problem of turning machine’ with neat diagrams? Understand / 6
CO-4
*** End ***