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