Scribd
Upload
30 views

Theory of Computation Question For Unit 5

Imp Theory of computation question

Uploaded by

YouTube all type
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

Theory of Computation Question For Unit 5

Imp Theory of computation question

Uploaded by

YouTube all type
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

THEORY OF COMPUTATION

DEPARTMENT OF COMPUTER ENGINEERING


Subject : TOC ASSIGNMENT NO – 05 Unit :V

1. Design TM for the language L={02n} over 0,1

2. Construct a TM to compute L   a b | n  0 Write simulation for the


n 2n

string. I) abb ii) aabbbb

3. Design a TM that multiplies two unary numbers over   1.

Write simulation for the string 11&111


4. Design TM to accept the set L of all strings formed with 0&1 and having
substring ‘000’
5. Differentiate between FA and TM.

6. Write a short notes on 1) Universal TM 2) Multi tape Turing Machine

7. Construct a Turing Machine to accept the language

n n n
L = { a b a | n>=1 }

8. Write a short notes on 1) Unsolvable problem 2) Application Turing Machine

9. Construct a Turing Machine R = aba*b

10. Construct a Turing Machine to accept string with equal nos of 0’s and 1’s.

11. Define TM. And Explain recursively enumerable set.

12. Write short notes on 1) Non-deterministic TM


2) Composite TM
3) Halting problem of TM.
4) Limitation of TM
n n
13. Obtain TM to accept language L = { 0 1 | n  =1 }

14. Explain the representation of TM.

15. Construct TM for 1’s complement of binary number.

16. Design a TM to accept language

L = { w / w (0 + 1)* } containing the substring 001.

17. Explain Language acceptance by TM.

18. Construct a TM to accept language of even nos of 0’s and 1’s.

19. Design TM to add unary number .

20. Construct TM for – L = { All string with equal nos of a’s and b’s.

****************** Best of Luck *******************

You might also like