Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata

DOI10.1016/S0022-0000(71)80029-6MaRDI QIDQ2558752zbMATH OpenOpenAlexFDO

Authors Oscar H. Ibarra

Publication date 1971

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(71)80029-6

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• An Approach to a Unified Theory of Automata
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Checking automata and one-way stack languages
• Halting Stack Automata
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• Nonerasing stack automata
• Relationships between nondeterministic and deterministic tape complexities
• Stack automata and compiling
• Two-Tape Simulation of Multitape Turing Machines
• Writing stack acceptors

Cited in

(30)

• Remarks on multihead pushdown automata and multihead stack automata
• On efficient recognition of transductions and relations
• Two-way automata with more than one storage medium
• On pebble automata
• Hierarchies of one-way multihead automata languages
• Tradeoffs for language recognition on alternating machines
• Time complexity of languages recognized by one-way multihead pushdown automata
• Iterated stack automata and complexity classes
• Two-way nested stack automata are equivalent to two-way stack automata
• Relating refined space complexity classes
• Stack languages and log n space
• A relation between space, return and dual return complexities
• The power of two-way deterministic checking stack automata
• Alternating and empty alternating auxiliary stack automata.
• On two-way multihead automata
• On Models of a Nondeterministic Computation
• scientific article; zbMATH DE number 3808971 (Why is no real title available?)
• On regular realizability problems
• (Semi)alternating stack automata
• On the complexity of finite, pushdown, and stack automata
• scientific article; zbMATH DE number 3576701 (Why is no real title available?)
• Register Transducers Are Marble Transducers
• New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
• Tree-walking-storage automata
• Generalizations of Checking Stack Automata: Characterizations and Hierarchies
• Transducers of polynomial growth
• Deterministic tree-walking-storage automata
• Deterministic real-time tree-walking-storage automata
• Deterministic real-time tree-walking-storage automata
• Polyregular functions: characterisations and refutations

This page was built for publication: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2558752)