Reidenbach_Schmid_Internal_Report_1110_Automata_with_Modulo_Counters.pdf (458.8 kB)
Automata with Modulo Counters and Nondeterministic Counter Bounds
preprint
posted on 2013-10-28, 10:20 authored by Daniel Reidenbach, Markus L. SchmidWe introduce and investigate Nondeterministically Bounded Modulo Counter
Automata (NBMCA), which are two-way multi-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.
History
School
- Science
Department
- Computer Science
Citation
REIDENBACH, D. and SCHMID, M.L., 2013. Automata with modulo counters and nondeterministic counter bounds. Internal Report 1110, Department of Computer Science, Loughborough University.Publisher
Department of Computer Science, Loughborough UniversityVersion
- AM (Accepted Manuscript)
Publication date
2013-10-16Notes
This is an internal report.Language
- en