GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
type: Item
instance of: scholarly article
title: GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
zbMATH Open document ID: 1171.68532
DOI: 10.1142/S0129054108006352
author: M. V. Panduranga Rao
published in: International Journal of Foundations of Computer Science
publication date: 2009-02-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5519647
zbMATH Keywords: deterministic counter automata
zbMATH Keywords: language recognition
MaRDI profile type: Publication
cites work: Two-way finite automata with quantum and classical states.
cites work: Fooling a two way automaton or one pushdown store is better than one counter for two way machines
cites work: Remarks on blind and partially blind one-way multicounter machines
cites work: Two-Way Counter Machines and Diophantine Equations
cites work: ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
cites work: Finite automata with multiplication
cites work: Extended finite automata over groups
cites work: Two-way deterministic multi-weak-counter machines
cites work: Remarks on two-way automata with weak-counters
cites work: Deterministic two-way one-head pushdown automata are very powerful
Recommended article: Theory and Applications of Models of Computation
Recommended article: Reversal complexity revisited
Recommended article: Q3758246
Recommended article: Reversal Complexity
Recommended article: Reversal-Bounded Counter Machines Revisited
Recommended article: Enumeration of Reversible Functions and Its Application to Circuit Complexity
Recommended article: Reversal Complexity Classes for Alternating Turing Machines
Recommended article: Reversal-bounded nondeterministic multicounter machines and complementation
Recommended article: Reversibility in space-bounded computation
Recommended article: Q3746890
description: scientific article