3. A Big Headed Turing Machine (BHTM) is just like an ordinary Turing machine, b

Question

3. A Big Headed Turing Machine (BHTM) is just like an ordinary Turing machine, but with the ability to read and write two adjacent tape symbols in one step. It moves left or right one cell at each step, as before. a) [5 ptsl Explain why BHTMs are no more powerful than ordinary Turing machines. b) 15 pts] For w (0,1), let SORT(u) be the sorted rearrangement of w, in which all the O's precede the 1's. For example, SORT(10110) = 00111. Explain how a BHTM can compute the SORT function. You don't have to describe your Turing machines completely, but give enough detail that a com petent Turing Machine programmer could implement them. 4. (Continuation.) Let L = {u : Fu(U-SORT(u))). That is, L is the image of the SORT function. Note that L is regular. a) 13 pts] Exhibit a deterministic finite automaton (DFA) M that recognizes L b) 13 ptsl For each state (i of your M, give a regular expression for That is,Li consists of all input words that leave M in state 9- c) 4 pts] Find a smallest DFA that accepts L(M). Here, "smallest" means "has the least number of states."

Explanation / Answer

a)

BHTm is not poweful when compare to ordinary
tuning machine.
TMs can give solutions to the halting problem on
all languages then BHTM.
The TMS use less power model of computation in actual
practice it can give result to the question and
slove halting problem.

b)

By using external sorting bhtm will sort the function.

To reduce the RAm space external sort is helpful.

a)

The set of strings which can be accepted by M accepts by the DFA language recognized by L and it is denoted byL(M).

c)

Algorithm has the way that can involves
the smallest DFA from L(M)

Related Questions

Navigate

• Browse (All)
• Browse 3
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.