Reidenbach_Schmid_CIAA_2012_final_version.pdf (284.91 kB)
Automata with modulo counters and nondeterministic counter bounds
conference contribution
posted on 2012-09-19, 08:19 authored by Daniel Reidenbach, Markus L. SchmidWe 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.
History
School
- Science
Department
- Computer Science
Citation
REIDENBACH, D. and SCHMID, M.L., 2012. Automata with modulo counters and nondeterministic counter bounds. IN: Moreira, N. and Reis, R. (eds.). Proceedings, 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Lecture Notes in Computer Science: Implementation and Application of Automata, 7381, pp.361-368.Publisher
© SpringerVersion
- AM (Accepted Manuscript)
Publication date
2012Notes
This is a conference paper. It was published in the Lecture Notes of Computer Science series [© Springer-Verlag]: www.springerlink.com.ISBN
9783642316050ISSN
0302-9743Publisher version
Book series
Lecture Notes in Computer Science;7381Language
- en