On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
From MaRDI portal
Publication:3674059
Cited in
(11)- Tradeoffs for language recognition on alternating machines
- Reversal-bounded nondeterministic multicounter machines and complementation
- One-reversal counter machines and multihead automata: revisited
- One-reversal counter machines and multihead automata: revisited
- scientific article; zbMATH DE number 3982518 (Why is no real title available?)
- scientific article; zbMATH DE number 4005620 (Why is no real title available?)
- Nondeterministic multicounter machines and complementation
- On reversal bounded alternating Turing machines
- A characterization of reversal-bounded multipushdown machine languages
- New results on the minimum amount of useful space
- Alternation for sublogarithmic space-bounded alternating pushdown automata
This page was built for publication: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674059)