On the simulation of many storage heads by one
From MaRDI portal
Publication:1348528
DOI10.1016/0304-3975(84)90115-4zbMath0985.68513OpenAlexW2103679684MaRDI QIDQ1348528
Publication date: 13 May 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/6607
Related Items (2)
Tape versus queue and stacks: The lower bounds ⋮ An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape
Cites Work
- On the power of real-time two-way multihead finite automata with jumps
- An information-theoretic approach to time bounds for on-line computation
- Real time computation
- On-line simulation of k + 1 tapes by k tapes requires nonlinear time
- An Optimal Simulation of Counter Machines: The ACM Case
- Relations Among Complexity Measures
- Two-Tape Simulation of Multitape Turing Machines
- Counter machines and counter languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the simulation of many storage heads by one
