Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
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
On monotonic automata with a restart operation
Journal of Automata, Languages and Combinatorics
Asymptotically efficient in-place merging
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Different Types of Monotonicity for Restarting Automata
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Inplace run-length 2d compressed search
Theoretical Computer Science
Church-rosser and related thue systems (word problem, rewrite rules, congruence)
Church-rosser and related thue systems (word problem, rewrite rules, congruence)
On membrane hierarchy in P systems
Theoretical Computer Science
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On the computational complexity of P automata
DNA'04 Proceedings of the 10th international conference on DNA computing
Restarting automata with restricted utilization of auxiliary symbols
Theoretical Computer Science - Implementation and application of automata
Nondeterministic one-tape off-line turing machines and their time complexity
Journal of Automata, Languages and Combinatorics
Hi-index | 0.00 |
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 overhead-free machines, we show that all context-free languages can be accepted nondeterministically in polynomial time with absolutely no space overhead, and that all deterministic context-free languages can be accepted deterministically in polynomial time with absolutely no space overhead.