A characterization of reversal-bounded multipushdown machine languages
From MaRDI portal
Publication:1058865
DOI10.1016/0304-3975(85)90052-0zbMath0565.68079OpenAlexW2046750655MaRDI QIDQ1058865
Marek Chrobak, Wojciech Rytter
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90052-0
Related Items
Cites Work
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- A note on bounded-reversal multipushdown machines
- Simple counter machines and number-theoretic problems
- Reversal-bounded multipushdown machines
- The reduction of tape reversals for off-line one-tape Turing machines
- Tape-reversal bounded Turing machine computations
- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Note on tape reversal complexity of languages
This page was built for publication: A characterization of reversal-bounded multipushdown machine languages
