Regular expressions with backreferences: polynomial-time matching techniques
From MaRDI portal
Cites work
- Automata Studies. (AM-34)
- Characterising REGEX languages by regular languages equipped with factor-referencing
- Closure properties and descriptional complexity of deterministic regular expressions
- Deciding definability by deterministic regular expressions
- Deterministic regular expressions with back-references
- Deterministic regular expressions with back-references
- Document spanners: a formal approach to information extraction
- Document spanners: from expressive power to decision problems
- Efficient testing and matching of deterministic regular expressions
- Evaluation and enumeration problems for regular path queries
- Extended regular expressions: succinctness and decidability
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- scientific article; zbMATH DE number 7278096 (Why is no real title available?)
- Matching patterns with variables
- On matching generalised repetitive patterns
- On the parameterised complexity of string morphism problems
- Parameterized regular expressions and their languages
- Pattern matching with variables: a multivariate complexity analysis
- Pattern matching with variables: efficient algorithms and complexity results
- Pattern matching with variables: fast algorithms and new hardness results
- Patterns with bounded treewidth
- Programming Techniques: Regular expression search algorithm
- Regular expressions with counting: weak versus strong determinism
- The complexity of regular expressions and property paths in SPARQL
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
This page was built for publication: Regular expressions with backreferences: polynomial-time matching techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907604)
