ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
From MaRDI portal
Publication:4286116
Recommendations
Cited in
(19)- GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
- scientific article; zbMATH DE number 7104930 (Why is no real title available?)
- scientific article; zbMATH DE number 6606353 (Why is no real title available?)
- 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 bounded languages and reversal-bounded automata
- On the determinacy problem for two-way pushdown automata
- Interference automata
- On Families of Full Trios Containing Counter Machine Languages
- Two-way Parikh automata with a visibly pushdown stack
- New decidability results concerning two-way counter machines and applications
- New Decidability Results Concerning Two-Way Counter Machines
- scientific article; zbMATH DE number 1929958 (Why is no real title available?)
- scientific article; zbMATH DE number 1979491 (Why is no real title available?)
- Two Grammatical Equivalents of Flip-Pushdown Automata
- On Counter Machines versus dP Automata
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)
