Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/10358

Title: Automata with modulo counters and nondeterministic counter bounds
Authors: Reidenbach, Daniel
Schmid, Markus L.
Keywords: Multi-head automata
Counter automata
Modulo counters
Stateless automata
Restricted nondeterminism
Issue Date: 2012
Publisher: © Springer
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.
Series/Report no.: Lecture Notes in Computer Science;7381
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.
Description: This is a conference paper. It was published in the Lecture Notes of Computer Science series [© Springer-Verlag]: www.springerlink.com.
Version: Accepted for publication
DOI: 10.1007/978-3-642-31606-7_33
URI: https://dspace.lboro.ac.uk/2134/10358
Publisher Link: http://dx.doi.org/10.1007/978-3-642-31606-7_33
ISBN: 9783642316050
ISSN: 0302-9743
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
Reidenbach_Schmid_CIAA_2012_final_version.pdf284.91 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.