Chapter 5: 3E (page 239)
Find a match in the following instance of the Post Correspondence Problem.
Short Answer
The required match is
Chapter 5: 3E (page 239)
Find a match in the following instance of the Post Correspondence Problem.
The required match is
All the tools & learning materials you need for study success - in one app.
Get started for freeQuestion: A two-dimensional finite automaton (2DIM-DFA) is defined as follows. The input is an rectangle, for any . The squares along the boundary of the rectangle contain the symbol # and the internal squares contain symbols over the input alphabet . The transition function indicates the next state and the new head position (Left, Right, Up, Down). The machine accepts when it enters one of the designated accept states. It rejects if it tries to move off the input rectangle or if it never halts. Two such machines are equivalent if they accept the same rectangles. Consider the problem of determining whether two of these machines are equivalent. Formulate this problem as a language and show that it is undecidable.
Question: Consider the problem of determining whether a two-tape Turing machine ever writes a nonblank symbol on its second tape during the course of its computation on any input string. Formulate this problem as a language and show that it is undecidable.
Use Rice’s theorem, which appears in Problem 5.28, to prove the undecidability of each of the following languages.
Consider the problem of determining whether a Turing machine on an input w ever attempts to move its head left at any point during its computation on . Formulate this problem as a language and show that it is decidable.
Show that if A is Turing-recognizable and , then A is decidable.
What do you think about this solution?
We value your feedback to improve our textbook solutions.