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

Title: Deterministic regular expressions with back-references
Authors: Freydenberger, Dominik D.
Schmid, Markus L.
Keywords: Deterministic regular expression
Glushkov automaton
Issue Date: 2017
Publisher: Schloss Dagstuhl – Leibniz Center for Informatics
Citation: FREYDENBERGER, D.D. and SCHMID, M.L., 2017. Deterministic regular expressions with back-references. Presented at the 34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017), Hanover, Germany, Mar 8-11th.
Series/Report no.: Schloss Dagstuhl – Leibniz Center for Informatics;66
Abstract: Most modern libraries for regular expression matching allow back-references (i. e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness and tractability, we combine these with the notion of determinism for regular expressions used in XML DTDs and XML Schema. This includes the definition of a suitable automaton model, and a generalization of the Glushkov construction.
Description: This is an Open Access Article. It is published by Schloss Dagstuhl under the Creative Commons Attribution 4.0 Unported Licence (CC BY). Full details of this licence are available at: http://creativecommons.org/licenses/by/4.0/
Version: Published
DOI: 10.4230/LIPIcs.STACS.2017.33
URI: https://dspace.lboro.ac.uk/2134/24359
Publisher Link: http://dx.doi.org/10.4230/LIPIcs.STACS.2017.33
ISSN: 1868-8969
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
FreydenbergerSchmid.pdfPublished version589.04 kBAdobe PDFView/Open


SFX Query

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