A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
From MaRDI portal
Recommendations
Cites work
Cited in
(50)- On the closure of pattern expressions languages under intersection with regular languages
- On the intersection of regex languages with regular languages
- On the language equivalence of NE star-patterns
- Bad news on decision problems for patterns
- Synchronized regular expressions
- Document spanners: from expressive power to decision problems
- Inclusion problems for patterns with a bounded number of variables
- On minimizing regular expressions without Kleene star
- How to settle the ReDoS problem: back to the classical automata theory
- A benchmark production tool for regular expressions
- Generating all minimal Petri net unsolvable binary words
- Deterministic regular expressions with back-references
- Pattern matching with variables: a multivariate complexity analysis
- On the semantics of regular expression parsing in the wild
- A note on the complexity of matching patterns with variables
- Characterising REGEX languages by regular languages equipped with factor-referencing
- Re-examining regular expressions with backreferences
- Document spanners: a formal approach to information extraction
- Synchronized regular expressions
- On the semantics of regular expression parsing in the wild
- Regular Expressions on Average and in the Long Run
- A polynomial time match test for large classes of extended regular expressions
- On the parameterised complexity of string morphism problems
- scientific article; zbMATH DE number 5671764 (Why is no real title available?)
- Bad News on Decision Problems for Patterns
- Inferring descriptive generalisations of formal languages
- On Extended Regular Expressions
- Extended regular expressions: succinctness and decidability
- Expressiveness and static analysis of extended conjunctive regular path queries
- Regular and context-free pattern languages over small alphabets
- Regular languages with variables on graphs
- Fair expressions and regular languages over lists
- scientific article; zbMATH DE number 1084695 (Why is no real title available?)
- scientific article; zbMATH DE number 1962769 (Why is no real title available?)
- Patterns with bounded treewidth
- scientific article; zbMATH DE number 7318987 (Why is no real title available?)
- scientific article; zbMATH DE number 7278096 (Why is no real title available?)
- Goodby to the kindhearted dragon Prof. Sheng Yu, 1950--2012
- Inside the class of REGEX languages
- Matching patterns with variables under edit distance
- On the undecidability and descriptional complexity of synchronized regular expressions
- Matching patterns with variables under Simon's congruence
- Pumping lemmas can be ``harmful
- Regular expressions with backreferences and lookaheads capture NLOG
- Decision problems concerning L systems
- Measuring the expressive power of practical regular expressions by classical stacking automata models
- Disambiguation of regular expressions with backreferences via term rewriting
- On the computational and descriptional complexity of multi-pattern languages
- Annotated regular expressions and input-driven languages
- Pattern expressions and pattern automata
This page was built for publication: A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696950)
