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

Title: Deterministic regular expressions with back-references
Authors: Freydenberger, Dominik D.
Schmid, Markus L.
Keywords: Deterministic regular expression
Glushkov automaton
Issue Date: 2019
Publisher: © Elsevier BV
Citation: FREYDENBERGER, D.D. and SCHMID, M.L., 2019. Deterministic regular expressions with back-references. Journal of Computer and System Sciences, 105, pp.1-39.
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. We demonstrate that, compared to their non-deterministic superclass, these deterministic regular expressions with back-references have desirable algorithmic properties (i. e., efficiently solvable membership problem and some decidable problems in static analysis), while, at the same time, their expressive power exceeds that of deterministic regular expressions without back-references.
Description: This paper is in closed access until 25th April 2020.
Version: Accepted for publication
DOI: 10.1016/j.jcss.2019.04.001
URI: https://dspace.lboro.ac.uk/2134/37693
Publisher Link: https://doi.org/10.1016/j.jcss.2019.04.001
ISSN: 0022-0000
Appears in Collections:Closed Access (Computer Science)

Files associated with this item:

File Description SizeFormat
det_JCSS.pdfAccepted version661.2 kBAdobe PDFView/Open


SFX Query

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