Deterministic regular expressions with back-references
From MaRDI portal
Publication:4636631
DOI10.4230/LIPICS.STACS.2017.33zbMATH Open1402.68115arXiv1802.01508MaRDI QIDQ4636631FDOQ4636631
Authors: Dominik D. Freydenberger, Markus L. Schmid 
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1802.01508
Recommendations
- Deterministic regular expressions with back-references
- Extended Regular Expressions: Succinctness and Decidability
- Checking determinism of regular expressions with counting
- Extended regular expressions: succinctness and decidability
- Regular expressions with nested levels of back referencing form a hierarchy
Cited In (12)
- Characterising REGEX languages by regular languages equipped with factor-referencing
- Synchronized regular expressions
- Regular Expressions with Counting: Weak versus Strong Determinism
- On the semantics of atomic subgroups in practical regular expressions
- Characterising REGEX languages by regular languages equipped with factor-referencing
- Regular expressions with nested levels of back referencing form a hierarchy
- Synchronized regular expressions
- A logic for document spanners
- Annotated regular expressions and input-driven languages
- Deterministic regular languages
- Re-examining regular expressions with backreferences
- On lookaheads in regular expressions with backreferences
This page was built for publication: Deterministic regular expressions with back-references
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636631)
