One Pebble Versus ε · log n Bits

Authors:
Viliam Geffert;Giovanni Pighizzini;Carlo Mereghetti
Affiliations:
(Partially supported by the Slovak Grant Agency for Science (VEGA) under contract 1/0035/09 "Combinatorial structures and complexity of algorithms".) Dept. of Comp. Sci., P. J. Šafárik U ...;(Partially supported by the Italian MIUR under project "Aspetti matematici e applicazioni emergenti degli automi e dei linguaggi formali: metodi probabilistici e combinatori in ambito di linguaggi ...;(Correspd.) (Partially supported by the Italian MIUR under project "Aspetti matematici e applicazioni emergenti degli automi e dei linguaggi formali: metodi probabilistici e combinatori in ambito ...
Venue:
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Year:
2010

Citing 21
Cited 0

On pebble automata

Theoretical Computer Science
Nondeterministic computations in sublogarithmic space and space constructibility

SIAM Journal on Computing
Tally versions of the Savitch and Immerman-Szelepcse´nyi theorems for sublogarithmic space

SIAM Journal on Computing
ASPACE(o(log log n)) is regular

SIAM Journal on Computing
An optimal lower bound for nonregular languages

Information Processing Letters
Deterministic versus nondeterministic space in terms of synchronized alternating machines

Theoretical Computer Science
Sublogarithmic Bounds on Space and Reversals

SIAM Journal on Computing
Some Results on Tape-Bounded Turing Machines

Journal of the ACM (JACM)
A variant of inductive counting

Theoretical Computer Science
Turing Machines with Sublogarithmic Space

Turing Machines with Sublogarithmic Space
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Space complexity of alternating Turing machines

FCT '85 Fundamentals of Computation Theory
Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
A language over a one symbol alphabet requiring only O (log log n) space

ACM SIGACT News
Some properties of one-pebble turing machines with sublogarithmic space

Theoretical Computer Science
Efficient algorithms for path system problems and applications to alternating and time-space complexity classes

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Factoring and Testing Primes in Small Space

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Hierarchies of memory limited computations

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Memory bounds for recognition of context-free and context-sensitive languages

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
Space bounds for processing contentless inputs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that, for any ε 0, there exists a language accepted in strong ε log n space by a 2-way deterministic Turing machine working with a single binary worktape, that cannot be accepted in sublogarithmic weak space by any pebble machine (i.e., a 2-way nondeterministic Turing machine with one pebble that can be moved onto the input cells). Moreover, we provide optimal unary lower bounds on the product of space and input head reversals for strong and weak pebble machines accepting nonregular languages.