GENERALIZED COUNTERS AND REVERSAL COMPLEXITY

DOI10.1142/S0129054108006352zbMath1171.68532MaRDI QIDQ3606557

M. V. Panduranga Rao

Publication date: 26 February 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

language recognitiondeterministic counter automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Remarks on two-way automata with weak-counters
• 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
• Finite automata with multiplication
• Remarks on blind and partially blind one-way multicounter machines
• Two-way finite automata with quantum and classical states.
• Two-Way Counter Machines and Diophantine Equations
• ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
• Extended finite automata over groups

This page was built for publication: GENERALIZED COUNTERS AND REVERSAL COMPLEXITY