Automata with modulo counters and nondeterministic counter bounds
conference contributionposted on 19.09.2012, 08:19 authored by Daniel Reidenbach, Markus L. Schmid
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.
- Computer Science