Scribd
Upload
23 views3 pages

TOC Unit 5 QB

Question bank of Theory of Computation Unit 5 Turning Machine

Uploaded by

ninad16089
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
23 views3 pages

TOC Unit 5 QB

Question bank of Theory of Computation Unit 5 Turning Machine

Uploaded by

ninad16089
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/ 3

Pimpri Chinchwad Education Trust's

PimpriChinchwad College of Engineering


TOC Practice Questions

Unit -V Turing Machine

Sr.No Question in Detail

Q.1 Compare between PDA and Turing Machine


Q.2 Justify how a Turing Machine can simulate a General Purpose
versa. computer and vice
Design Turing Machines for each of the following problems:
Q.3 i) Given two unary numbers, m and n, display, 'G, if m> n, 'E, if m
=n, L, if m<n

Q.4 Construct a TM for Language L= {a"b"|a>=1}


Construct a Turing machine to replace 110' by 101° in a binary input string
Q.5

Q.6 Construct a TM for checking ifa given set of parentheses are well-formed .Check the
acceptance of string (00
Construct a TM that replaces every occurrence of abb by baa.for all strings over fa,b}
Q.7
Constructa Turing machine Mto recognize the language {a" b' c"|n >=1}
Q.8
Construct a Turing machine to obtain the reverse string from the given input string over
Q.9 E= {a, b}*
Given twO unary numbers, find the Greatest Common Divisor (GCD) of the two numbers.
Q.10

Q.11 Design a Turing Machine for unary number Addition


Design a Turing Machine to do Multiplication of two Unary number
Q.12
Discuss Turing Machine working with one example
Q.13
Construct a Turing Machine to do copying of astring over (0,1}
Q.14
Construct a Turing Machine to do reverse of astring overfa.b}
Q.15
Construct a Turing machine for LanguageL=WCW"|where Ware string from{0,
Q.16 and W* is reverse of astring W}
Construct TM for-L=fallstrings with equal no. of a's and b's}.
Q.17
What are the different ways for extension of TM?
Q.18 Explain.
Construct a two tape TM to convert an input W into WW*.
Q.19

Design a Turing Machine which computes the 2's complement of a given


Q.20 binary number
Construct the Turing Machine that accepts the language (a*ba*b)
Q.21
Construct the Turing Machine that recognize a string ends in 00for allstrings
Q.22 from {a,b}
Construct A Turing Machine that will recognize all palindrome
Q.23 strings
Discuss the halting problem of Turing Machine
Q.24
Write short note on Universal Turing Machine (UTM)
Q9.25
Explain the representation of TM.
Q.26
Define the Turing machine. Comment on language
Q.27 acceptance by Turing machine
Discuss the Various Types of Turing Machine
0.28
Compare Recursive and Recursively enumerable languages
Q.29
Prove that every recursive language is
Q.30 recursively enumerable
Prove that recursive languages are closed under
Q.31 Union, complement.
Discuss the Limitations of Turing Machine
0.32
Prove that recursive languages are closed under
Q.33 Intersection, Kleen's Closure.
Prove that Halting Problem is Unsolvable
Q.34
Write short note on types ofTuring
Q.35 Machine
Prove that Universal Turing machine
0.36 resembles the model of Computer
Prove that the NTM= DTM, there
Q.37 exists Deterministic Turing
deterministic Turing Machine Machine for every non
Compare between PDA and TM
Q.38

|).39
Compare between TM and FA
Construct a Turing Machine for checking if a given set of parentheses are wellformed
Q.40
Design a TM that accepts the language of odd integers written in binary.
Q.41
Q.42 Construct a Turing machine to compute 'n mod 2' where n is represented in the tape in
unary form consisting of only 0's
Q.43 Construct a NTM to accept a Language L= WWwhere wis a string over {a,b}
Q.44 List and explain any two variants of Turing Machine. How is their power cquivalent to
that of a Turing Machine -explain.
Q.45 Explain in brief- Recursive Languages and Recursively Enumerable Languages
Q.46 Design a Turing Machine that reads a string representing a binary number
and erases all leading 0's in the string. However, if the string comprises of
only 0's it keeps one O
Q.47 Here transition function of Non deterministic Turing Machine
M({Qo.QiQ:}. {0.1}.{0,1.B}6.qo,B.42}) is given,

0 1 B
Q0 (Qo1,R) (Q0,R)
(Q10,R), (Q11,R), (Q B,R)
(Qo0,L) (Qo1,L)
Q

show the transition (ID's)for input


a. 01
b. 011
{0"1"0"n>=1}
Q.48 Construct the TM that accept the Language
enumerable then Language I
Q.49 Prove that if both Language and its complement IS recursive
isrecursive.
L={ X¬{0,l}* x ends in 00 3
Q.50 Construct the TM that recognize the Language

You might also like