Abstract
The following simulations by machines equipped with a one-way input tape and additional queue storage are shown: Every nondeterministic single-tape Turing machine (no separate input-tape) with time bound $t(n)$ can be simulated by one queue in $O(t(n))$ time. Every deterministic machine with a one-turn pushdown store can be simulated deterministically by one queue in $O(n\sqrt{n})$ time. Every Turing machine with several multidimensional tapes accepting with time bound $t(n)$ can be simulated by two queues in $O(t(n) \log^2 t(n))$ time. Every deterministic Turing machine with several linear tapes accepting with time bound $t(n)$ can be simulated deterministically in time $O(t(n) \log t(n))$ by a queue and a pushdown store. The first two results appear to be the first subquadratic simulations of other storage devices by one queue.
Sign-in/Register to access full text options 
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
