Scribd
Upload
21 views

Unit 5 QB

This is presentation of unit 5

Uploaded by

tptanupatil18
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
21 views

Unit 5 QB

This is presentation of unit 5

Uploaded by

tptanupatil18
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

K. K. Wagh Institute of Engineering Education and Research, Nashik.

Department of Information Technology


Question bank (2022 Pattern)
Theory of Computation
(INT223001)
2024-2025 (Semester I)

Unit –5 Turing Machine.

1. Define Recursive Languages and recursively enumerable languages with example


2. Construct TM to replace string 110 by 101 in binary input string
3. Design TM to find 2’ s complement for binary number
4. Design TM to find log2n, where n is binary number and perfect power of 2.
5. Construct a Turing machine to perform mod 2 operation on given binary number retain original
number as well as store result after number separated by blank
6. Design a TM which accepts all strings of the form an bn for n>=1 and rejects all other strings. Draw
the transition diagram. Simulate TM for some string.
7. Construct TM for the language L={a n bn cn | n>0} Show simulation for i)aabbcc ii)aabbccc

8. State and prove Halting problem of Turing Machine is


unsolvable

9. Write a short note on:


i)Church Turing Hypothesis. ii) Post correspondence problem

10. Design a TM that performs the addition of two unary numbers


11. Design a TM that recognizes binary palindromes.
12. Construct a TM for checking if a set of parentheses are well formed

13. Design a TM that recognizes strings containing equal number of zeros and equal number of ones.

14. Explain the following for a TM-


i) Power of TM over finite state machines ii) Universal TM

You might also like