Pages that link to "Item:Q5696950"
From MaRDI portal
The following pages link to A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS (Q5696950):
Displayed 32 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Inferring descriptive generalisations of formal languages (Q355503) (← links)
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Expressiveness and static analysis of extended conjunctive regular path queries (Q389234) (← links)
- Regular and context-free pattern languages over small alphabets (Q391783) (← links)
- Regular languages with variables on graphs (Q418127) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Annotated regular expressions and input-driven languages (Q783684) (← links)
- Pattern expressions and pattern automata (Q834961) (← links)
- On the closure of pattern expressions languages under intersection with regular languages (Q1015391) (← links)
- On the intersection of regex languages with regular languages (Q1019712) (← links)
- On the language equivalence of NE star-patterns (Q1041796) (← links)
- Bad news on decision problems for patterns (Q1049406) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
- How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
- Generating all minimal Petri net unsolvable binary words (Q2295623) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- On the semantics of regular expression parsing in the wild (Q2357106) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Characterising REGEX languages by regular languages equipped with factor-referencing (Q2629848) (← links)
- Re-examining regular expressions with backreferences (Q2699953) (← links)
- Document Spanners (Q2796400) (← links)
- A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (Q3073643) (← links)
- Bad News on Decision Problems for Patterns (Q3533022) (← links)
- On Extended Regular Expressions (Q3618588) (← links)
- (Q5136316) (← links)
- GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012 (Q5495413) (← links)
- INSIDE THE CLASS OF REGEX LANGUAGES (Q5495423) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)