Abstract
We consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which the input is written. It is known that there are nonregular languages accepted by such machines in time O( n log log n), and an NP-complete language accepted in time O( n log n). We exhibit nonregular languages accepted by such machines in time n + O(√ nlog n) or n + O(log 2 n), and an NP-complete language accepted in time n + O(√ nlog n, by using a tight padding method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
