Theory of Computation - Turing Machines

Problem 1. Computation trees for Nondeterministic TMs. The following is a diagram of a part of some NTM computation tree on input abb, starting with the initial configuration; for the transitions (labels on edges), we only show the new character, head move, and new state (in that order). Note: the configurations are being represented using the book's notation] loabb d.S.q3 a,R,q S.q5 c,L,ql d.R.3 a,R.q3 a) Under each node, write its address (defined as in the proof of theorem 3.16); the address of the root is E b) List the addresses for all the nodes from the diagram in breadth-first order. c) We are traversing the computation tree, and we have reached node 312; what are the transitions that need to be made to reach this node from the root of the tree? Show them as a list of 5-tuples (current state, input char, new char, head move, new state) d) Inside each node, write the configuration that corresponds to it, in textbook's notation (as we've done for the root) Problem 1. Computation trees for Nondeterministic TMs. The following is a diagram of a part of some NTM computation tree on input abb, starting with the initial configuration; for the transitions (labels on edges), we only show the new character, head move, and new state (in that order). Note: the configurations are being represented using the book's notation] loabb d.S.q3 a,R,q S.q5 c,L,ql d.R.3 a,R.q3 a) Under each node, write its address (defined as in the proof of theorem 3.16); the address of the root is E b) List the addresses for all the nodes from the diagram in breadth-first order. c) We are traversing the computation tree, and we have reached node 312; what are the transitions that need to be made to reach this node from the root of the tree? Show them as a list of 5-tuples (current state, input char, new char, head move, new state) d) Inside each node, write the configuration that corresponds to it, in textbook's notation (as we've done for the root)