Automata with modulo counters and nondeterministic counter bounds

Authors:
Daniel Reidenbach;Markus L. Schmid
Affiliations:
Department of Computer Science, Loughborough University, Loughborough, Leicestershire, United Kingdom;Department of Computer Science, Loughborough University, Loughborough, Leicestershire, United Kingdom
Venue:
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Year:
2012

Citing 9
Cited 0

On pebble automata

Theoretical Computer Science
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Automata with sensing heads

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
On partially blind multihead finite automata

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On Stateless Multihead Finite Automata and Multihead Pushdown Automata

DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Hierarchies and Characterizations of Stateless Multicounter Machines

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On stateless multihead automata: Hierarchies and the emptiness problem

Theoretical Computer Science
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
The geoviz toolkit: using component-oriented coordination methods for geographic visualization and analysis

International Journal of Geographical Information Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are two-way one-head automata that comprise a constant number of modulo counters, where the counter bounds are nondeterministically guessed, and this is the only element of nondeterminism. NBMCA are tailored to recognising those languages that are characterised by the existence of a specific factorisation of their words, e.g., pattern languages. In this work, we subject NBMCA to a theoretically sound analysis.