Computability of Recursive Functions
Journal of the ACM (JACM)
Formal languages and their relation to automata
Formal languages and their relation to automata
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
A Perspective on Lindström Quantifiers and Oracles
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
An observation on time-storage trade off
Journal of Computer and System Sciences
On distributing symmetric streaming computations
ACM Transactions on Algorithms (TALG)
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
| Hi-index | 0.00 |
A new device called a maze recognizing automaton is introduced. The following two statements are shown to be equivalent. (i) There is a maze recognizing automaton that accepts precisely the threadable mazes. (ii) Every nondeterministic L(n)-tape bounded Turing machine can be simulated by a deterministic L(n)-tape bounded Turing machine, provided L(n)=log"2n.