GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
From MaRDI portal
Publication:3606557
DOI10.1142/S0129054108006352zbMATH Open1171.68532MaRDI QIDQ3606557FDOQ3606557
Authors: M. V. Panduranga Rao 
Publication date: 26 February 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Theory and Applications of Models of Computation
- Reversal complexity revisited
- scientific article; zbMATH DE number 4007730
- Reversal Complexity
- Reversal-Bounded Counter Machines Revisited
- Enumeration of reversible functions and its application to circuit complexity
- Reversal Complexity Classes for Alternating Turing Machines
- Reversal-bounded nondeterministic multicounter machines and complementation
- Reversibility in space-bounded computation
- scientific article; zbMATH DE number 3982521
Cites Work
- Two-way finite automata with quantum and classical states.
- Remarks on blind and partially blind one-way multicounter machines
- Deterministic two-way one-head pushdown automata are very powerful
- Fooling a two way automaton or one pushdown store is better than one counter for two way machines
- Two-way deterministic multi-weak-counter machines
- Remarks on two-way automata with weak-counters
- Extended finite automata over groups
- Finite automata with multiplication
- Two-Way Counter Machines and Diophantine Equations
- ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
Cited In (2)
This page was built for publication: GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606557)
