ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES

DOI10.1142/S0129054193000092zbMath0802.68088OpenAlexW2069826658MaRDI QIDQ4286116

Oscar H. Ibarra, Tao Jiang, Hui Wang, Nicholas Q. Tran

Publication date: 27 April 1994

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054193000092

zbMATH Keywords

pushdown automatacounter machinesemptinessreversal-bounded

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

The equivalence of pebbles and sensing heads for finite automata ⋮ Unnamed Item ⋮ GENERALIZED COUNTERS AND REVERSAL COMPLEXITY ⋮ Interference automata

This page was built for publication: ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES