Reversal-Bounded Counter Machines Revisited
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3928351
- On reversal bounded alternating Turing machines
- Reversal-bounded nondeterministic multicounter machines and complementation
- Reversal-bounded multicounter ?-machines
- Unboundedness problems for machines with reversal-bounded counters
- Automata with Reversal-Bounded Counters: A Survey
- scientific article; zbMATH DE number 3932419
- A note on bounded-reversal multipushdown machines
Cited in
(19)- Pushdown automata with reversal-bounded counters
- On the power of alternation on reversal-bounded alternating Turing machines with a restriction
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Dense-choice counter machines revisited
- On store languages and applications
- The complexity of reversal-bounded model-checking
- On selective unboundedness of VASS
- GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
- Solvable problems for transformers with reversal-bounded counters
- Reversal-bounded multicounter ?-machines
- Budget-bounded model-checking pushdown systems
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Reachability in timed counter systems
- Automata with Reversal-Bounded Counters: A Survey
- Witness Runs for Counter Machines
- Unboundedness problems for machines with reversal-bounded counters
- Reasoning about reversal-bounded counter machines
- Weakly synchronous systems with three machines are Turing powerful
- Counter machines with infrequent reversals
This page was built for publication: Reversal-Bounded Counter Machines Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599138)