ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
From MaRDI portal
Publication:4286116
DOI10.1142/S0129054193000092zbMATH Open0802.68088OpenAlexW2069826658MaRDI QIDQ4286116FDOQ4286116
Authors: Oscar H. Ibarra, Tao Jiang, Nicholas Q. Tran, Hui Wang 
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
Recommendations
Cited In (18)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two
- The equivalence of pebbles and sensing heads for finite automata
- Bounded counter languages
- A note on bounded-reversal multipushdown machines
- On the determinacy problem for two-way pushdown automata
- On bounded languages and reversal-bounded automata
- Interference automata
- On Families of Full Trios Containing Counter Machine Languages
- New decidability results concerning two-way counter machines and applications
- New Decidability Results Concerning Two-Way Counter Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two Grammatical Equivalents of Flip-Pushdown Automata
- On Counter Machines versus dP Automata
- GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
This page was built for publication: ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286116)
