Add to ORKGWe show that pebble machines (i.e., 2-way nondeterministic Turing machines with one pebble that can be moved onto the input cells) working in sublogarithmic weak space are not able to simulate strong log-space bounded 2-way deterministic Turing machines. We prove this by exhibiting a witness language. Moreover, we provide an optimal lower bound on the product of space and input head reversals for pebble machines accepting nonregular languages
International audienceDeterministic one-way Turing machines with sublinear space bounds are systemat...
AbstractThis paper introduces a probabilistic rebound Turing machine (PRTM), and investigates the fu...
It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space proba...
We show that, for any \u3f5 > 0, there exists a language accepted in strong \u3f5 log n space by a 2...
AbstractThis paper investigates some aspects of the accepting powers of deterministic, nondeterminis...
AbstractWe look at two simple variations of space-bounded Turing machines (TM's): An off-line S(n)-s...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...
In this paper, simultaneous lower bounds on space and input head reversals for deterministic, nondet...
In [6] it was shown that shuffle languages are contained in one-way-NSPACE(log n) and in P. In this ...
This paper considers the well-known Turing machine model, the nondeterministic real-time Turing mach...
In this work we study classes of languages accepted by finitely ambiguous space bounded automata whi...
We show that one-way Π2-alternating Turing machines cannot accept unary nonregular languages in o(lo...
We prove a tight log n lower bound on middle space for one-way alternating Turing machines that acce...
The complexity measure under consideration is SPACE x REVERSALS for Turing machines that are able to...
International audienceDeterministic one-way Turing machines with sublinear space bounds are systemat...
AbstractThis paper introduces a probabilistic rebound Turing machine (PRTM), and investigates the fu...
It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space proba...
We show that, for any \u3f5 > 0, there exists a language accepted in strong \u3f5 log n space by a 2...
AbstractThis paper investigates some aspects of the accepting powers of deterministic, nondeterminis...
AbstractWe look at two simple variations of space-bounded Turing machines (TM's): An off-line S(n)-s...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...
We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alt...
In this paper, simultaneous lower bounds on space and input head reversals for deterministic, nondet...
In [6] it was shown that shuffle languages are contained in one-way-NSPACE(log n) and in P. In this ...
This paper considers the well-known Turing machine model, the nondeterministic real-time Turing mach...
In this work we study classes of languages accepted by finitely ambiguous space bounded automata whi...
We show that one-way Π2-alternating Turing machines cannot accept unary nonregular languages in o(lo...
We prove a tight log n lower bound on middle space for one-way alternating Turing machines that acce...
The complexity measure under consideration is SPACE x REVERSALS for Turing machines that are able to...
International audienceDeterministic one-way Turing machines with sublinear space bounds are systemat...
AbstractThis paper introduces a probabilistic rebound Turing machine (PRTM), and investigates the fu...
It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space proba...