Generalized counters and reversal complexity

Authors:
M. V. Panduranga Rao
Affiliations:
Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 6
Cited 0

Deterministic two-way one-head pushdown automata are very powerful

Information Processing Letters - Lecture Notes in Computer Science, no. 173
Two-way one-counter automata accepting bounded languages

ACM SIGACT News
Two-Way Counter Machines and Diophantine Equations

Journal of the ACM (JACM)
Extended finite automata over groups

Discrete Applied Mathematics
Two-way finite automata with quantum and classical states

Theoretical Computer Science - Natural computing
The Accepting Power of Finite Automata over Groups

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.