Re-examining regular expressions with backreferences

DOI10.1016/J.TCS.2022.10.041OpenAlexW4308358086MaRDI QIDQ2699953

Martin Berglund, Brink van der Merwe

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.041

zbMATH Keywords

regular expressionsbackreferences

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On the undecidability and descriptional complexity of synchronized regular expressions

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular expressions with nested levels of back referencing form a hierarchy
• Extended regular expressions: succinctness and decidability
• Synchronized regular expressions
• Pattern matching with variables: a multivariate complexity analysis
• On the semantics of atomic subgroups in practical regular expressions
• Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
• Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing
• Inside the Class of REGEX Languages
• On Extended Regular Expressions
• Programming Techniques: Regular expression search algorithm
• A helpful result for proving inherent ambiguity
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS

This page was built for publication: Re-examining regular expressions with backreferences