Deterministic regular expressions with back-references

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

zbMATH Keywords

regexGlushkov automatondeterministic regular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• Synchronized regular expressions
• Regular Expressions with Counting: Weak versus Strong Determinism
• A logic for document spanners
• Annotated regular expressions and input-driven languages
• Re-examining 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)