scientific article; zbMATH DE number 512842
From MaRDI portal
Publication:4281537
Recommendations
Cited in
(17)- A note on bounded-reversal multipushdown machines
- On the determinacy problem for two-way pushdown automata
- On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two
- Bounded counter languages
- On two-way weak counter machines
- ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
- New Decidability Results Concerning Two-Way Counter Machines
- scientific article; zbMATH DE number 1979491 (Why is no real title available?)
- New decidability results concerning two-way counter machines and applications
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
- Two Grammatical Equivalents of Flip-Pushdown Automata
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- On Counter Machines versus dP Automata
- scientific article; zbMATH DE number 6606353 (Why is no real title available?)
- Boundedness problems for Minsky counter machines
- One-reversal counter machines and multihead automata: revisited
- Two-way one-counter nets revisited
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281537)
