Note on tape reversal complexity of languages
From MaRDI portal
Publication:5592249
DOI10.1016/S0019-9958(70)90549-8zbMath0196.01801MaRDI QIDQ5592249
No author found.
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Related Items (9)
Comparison of the power between reversal-bounded ATMs and reversal- bounded NTMs ⋮ On reversal bounded alternating Turing machines ⋮ Complexity of algorithms and computations ⋮ On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals ⋮ Reversal-bounded multipushdown machines ⋮ Pushdown automata with counters ⋮ Theory of formal grammars ⋮ A characterization of reversal-bounded multipushdown machine languages ⋮ Unnamed Item
This page was built for publication: Note on tape reversal complexity of languages
