Overhead-Free Computation, DCFLs, and CFLs
| dc.creator | Hemaspaandra, Lane A. | |
| dc.creator | Mukherji, Proshanto | |
| dc.creator | Tantau, Till | |
| dc.date | 2004-10-15 | |
| dc.date.accessioned | 2026-07-07T03:21:52Z | |
| dc.date.available | 2026-07-07T03:21:52Z | |
| dc.description | 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 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0410035 | |
| dc.identifier | http://arxiv.org/abs/cs/0410035 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32371 | |
| dc.subject | Computational Complexity | |
| dc.subject | F.4.3; F.1.1 | |
| dc.title | Overhead-Free Computation, DCFLs, and CFLs | |
| dc.type | text |