Note on tape reversal complexity of languages

DOI10.1016/S0019-9958(70)90549-8MaRDI QIDQ5592249zbMATH OpenFDO

Authors

Publication date 1970

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(70)90549-8

zbMATH Keywords

languages, automata, networks

Cited in

(9)

• Theory of formal grammars
• Reversal-bounded multipushdown machines
• Complexity of algorithms and computations
• On reversal bounded alternating Turing machines
• Pushdown automata with counters
• scientific article; zbMATH DE number 4058871 (Why is no real title available?)
• A characterization of reversal-bounded multipushdown machine languages
• Comparison of the power between reversal-bounded ATMs and reversal- bounded NTMs
• On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals

This page was built for publication: Note on tape reversal complexity of languages

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