Unformatted text preview: 5. L = { x # y  x,y ∈ { , 1 } + ,x n = y } . a) Describe an e±cient singletape deterministic TM accepting L . What is the time complexity of your TM? b) Describe a singletape nondeterministic TM accepting L whose time complexity is O ( n log n ). 6. A writeonce TM is a singletape TM that can alter the content of each tape cell at most once (including the input portion of the tape); but it can visit the cell more than once. Show any singletape TM can be simulated by a writeonce TM. [Hint: Use lots of tape.]...
View
Full Document
 Winter '08
 Ibarra,O
 Insertion Sort, Big O notation, Analysis of algorithms, Computational complexity theory, TM

Click to edit the document details