Reference no: EM133254205
Exercise 1 (Theory & Proofs)
Answer the following.
Question 1. Consider a language L0 that is enumerated by a Turing Machine TM0. Is it possible to create a Turing Machine TM6 that only accepts strings in L0, instead?
Question 2. Consider a Turing Machine TMs, which simulates a k-tape Turing Machine TMk. Show that if nth has polynomial time complexity, so does its simulation.
Exercise 2 (Turing Machine Variations)
Consider the language L1 = {a*aib*bi i N}. Construct a 2-tape Turing Machine TM1 that accepts L1.
Question 1. Provide three examples of 1 ∈ L1.
Question 2. Describe the functionality of TM1 in natural language.
Question 3. Provide a state diagram for TM1.
Question 4. State and justify the complexity of TM1.
Exercise 3 (Language Enumerating Turing Machines)
Consider a language L2 = {a2k | k ∈ N}. Construct a language-enumerating k - tape Turing Machine that enumerates L2.
Question 1. Provide three examples of 1 ∈ L2.
Question 2. Choose a value for k and justify it.
Question 3. Describe the functionality of TM2 in natural language.
Question 4. Provide a state diagram for TM2.
Question 5. State and justify the complexity of TM2.
Exercise 4 (Non-deterministic Turing Machine) We call a number x composite if it is not prime. That is, x is composite if it can be represented as a product of natural numbers n, m E N and n, m > 1. Construct a non-deterministic Turing Machine that accepts strictly the language composed of the unary representation of composite numbers. Recall the unary representation of natural numbers, i.e., 5 → 111111.
1. Describe the Turing Machine in natural language.
2. Draw a state diagram for ML,3.
Attachment:- Turing Machine Variations.rar