Deterministic multitape automata computations
From MaRDI portal
Publication:1393939
DOI10.1016/S0022-0000(74)80054-1zbMath0277.68023MaRDI QIDQ1393939
Yoshihide Igarashi, Namio Honda
Publication date: 1974
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80054-1
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
03D10: Turing machines and related notions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time-bounded grammars and their languages
- On the Computational Complexity of Algorithms
- Two-Tape Simulation of Multitape Turing Machines
- Recognition and parsing of context-free languages in time n3
- Computational Complexity of One-Tape Turing Machine Computations
- A note on computing time for the recognition of context-free languages by a single-tape Turing machine
- One-tape, off-line Turing machine computations
- Multitape AFA