Chapter 0: Q23P (page 1)
Let it be any language over the alphabet . Prove that
Short Answer
Thus, the solution is .
Chapter 0: Q23P (page 1)
Let it be any language over the alphabet . Prove that
Thus, the solution is .
All the tools & learning materials you need for study success - in one app.
Get started for freeIn the fixed-point version of the recursion theorem (Theorem 6.8), let the transformation t be a function that interchanges the states and in Turing machine descriptions. Give an example of a fixed point for t.
Let
contains all size 3 columns of 0s and 1 s. A string of symbols ingives three rows of 0s and 1s. Consider each row to be a binary number and let B=the bottom row of W is the sum of the top two rows}.
For example,
Show that Bis regular.
(Hint: Working with is easier. You may assume the result claimed in Problem 1.31.)
Read the informal definition of the finite state transducer given in Exercise 1.24. Give the state diagram of an FST with the following behaviour. Its input and output alphabets are . Its output string is identical to the input string on the even positions but inverted on the odd positions. For example, on input 0000111 it should output 1010010 .
Show that P is closed under homomorphism iff P = NP.
Show that if is a CFG in Chomsky normal form, then for any string of length exactly steps are required for any derivation of .
What do you think about this solution?
We value your feedback to improve our textbook solutions.