Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2017.33
URN: urn:nbn:de:0030-drops-70004
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7000/
Freydenberger, Dominik D. ; Schmid, Markus L.
Deterministic Regular Expressions with Back-References
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{freydenberger_et_al:LIPIcs:2017:7000,
author = {Dominik D. Freydenberger and Markus L. Schmid},
title = {{Deterministic Regular Expressions with Back-References}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Heribert Vollmer and Brigitte Vallée},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7000},
URN = {urn:nbn:de:0030-drops-70004},
doi = {10.4230/LIPIcs.STACS.2017.33},
annote = {Keywords: Deterministic Regular Expression, Regex, Glushkov Automaton}
}
| Keywords: | Deterministic Regular Expression, Regex, Glushkov Automaton | |
| Seminar: | 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 06.03.2017 |
