Deterministic multitape automata computations

DOI10.1016/S0022-0000(74)80054-1zbMath0277.68023OpenAlexW2041146144MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10)

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

This page was built for publication: Deterministic multitape automata computations