The Power of Alternating One-Reversal Counters and Stacks
From MaRDI portal
Publication:3210175
DOI10.1137/0220018zbMath0722.68054OpenAlexW1973956010MaRDI QIDQ3210175
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220018
computational complexityTuring machinerecursively enumerable setalternationreversalspushdown automatacounter machine
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
On the power of 1-tape off-line ATMs running in a bounded number of reversals ⋮ A characterization of exponential-time languages by alternating context- free grammars ⋮ A note on simple programs with two variables
This page was built for publication: The Power of Alternating One-Reversal Counters and Stacks