Computation with absolutely no space overhead

Authors:
Lane A. Hemaspaandra;Proshanto Mukherji;Till Tantau
Affiliations:
Department of Computer Science, University of Rochester, Rochester, NY;Department of Computer Science, University of Rochester, Rochester, NY;Fakultät IV - Elektrotechnik und Informatik, Technische Universität Berlin, Berlin, Germany
Venue:
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Year:
2003

Citing 13
Cited 4

Formal languages

Formal languages
Some subclasses of context-free languages in NC1

Information Processing Letters
The method of forced enumeration for nondeterministic automata

Acta Informatica
Nondeterministic space is closed under complementation

SIAM Journal on Computing
Performing in-place affine transformations in constant space

Proceedings of the conference on Graphics interface '92
In-place sorting with fewer moves

Information Processing Letters
Asymptotically efficient in-place merging

Theoretical Computer Science
On the Complexities of Linear LL(1) and LR(1) Grammars

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Inplace run-length 2d compressed search

Theoretical Computer Science
Computation with Absolutely No Space Overhead

Computation with Absolutely No Space Overhead
Formal languages and their relation to automata

Formal languages and their relation to automata
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Context-free languages can be accepted with absolutely no space overhead

Information and Computation
Lower bound technique for length-reducing automata

Information and Computation
Context-free languages can be accepted with absolutely no space overhead

Information and Computation
Restricting the use of auxiliary symbols for restarting automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study Turing machines that are allowed absolutely no space overhead. The only work space the machines have, beyond the fixed amount of memory implicit in their finite-state control, is that which they can create by cannibalizing the input bits' own space. This model more closely reflects the fixed-sized memory of real computers than does the standard complexity-theoretic model of linear space. Though some context-sensitive languages cannot be accepted by such machines, we show that subclasses of the context-free languages can even be accepted in polynomial time with absolutely no space overhead.