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/13438

Title: Automata with Modulo Counters and Nondeterministic Counter Bounds
Authors: Reidenbach, Daniel
Schmid, Markus L.
Issue Date: 16-Oct-2013
Publisher: Department of Computer Science, Loughborough University
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.
Abstract: We 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.
Description: This is an internal report.
Version: Accepted for publication
URI: https://dspace.lboro.ac.uk/2134/13438
Appears in Collections:Working Papers (Computer Science)

Files associated with this item:

File Description SizeFormat
Reidenbach_Schmid_Internal_Report_1110_Automata_with_Modulo_Counters.pdfAccepted version458.8 kBAdobe PDFView/Open

 

SFX Query

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