One-Tape Turing Machines
[7/14%]Let be the one-tape DTM defined by the quintuple (, , where and is given by the following table:
| B | |||
|---|---|---|---|
Draw the transition diagram. What will be the computation on the input ? On the input ?
Trace DTM of Example 4.1 and show the computation of on inputs aabba and bbbab.
Consider the DTM with , , and
| B | |||
|---|---|---|---|
Trace on inputs aaab, abaa and aaaa.
What is ?
Consider the DTM , with , , and
| B | |||
|---|---|---|---|
Trace on inputs aaabba and .
What is the function computed by ?
Consider the DTM , in which and are the same as those of , and is the same as of except for
| B | |||
|---|---|---|---|
.
What is ?
Show that every regular language is Turing-decidable.
Assume that is Turing-decidable. Show that the language is also Turing-decidable. That is, for a given DTM that computes the characteristic function of , describe in detail how to modify to get a new DTM such that computes the characteristic function of . Can you do the same for Turing-acceptable languages?