This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 5. L = { x # y  x,y { , 1 } + ,x n = y } . a) Describe an ecient 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
This note was uploaded on 01/28/2012 for the course CS 220 taught by Professor Ibarra,o during the Winter '08 term at UCSB.
 Winter '08
 Ibarra,O

Click to edit the document details