Pages that link to "Item:Q3113715"
From MaRDI portal
The following pages link to Extended Regular Expressions: Succinctness and Decidability (Q3113715):
Displaying 18 items.
- Regular expressions with nested levels of back referencing form a hierarchy (Q293228) (← links)
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Expressiveness and static analysis of extended conjunctive regular path queries (Q389234) (← links)
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- Extended regular expressions of star degree at most two (Q921911) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
- Parameterized regular expressions and their languages (Q1944774) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Document spanners: a formal approach to information extraction (Q2796400) (← links)
- Parameterized regular expressions and their languages (Q2911637) (← links)
- A Compact Proof of Decidability for Regular Expression Equivalence (Q2914749) (← links)
- Succinctness of the Complement and Intersection of Regular Expressions (Q2946652) (← links)
- Bit-coded Regular Expression Parsing (Q3004600) (← links)
- Semi-linear Parikh Images of Regular Expressions via Reduction (Q3586120) (← links)
- Deterministic regular expressions with back-references (Q4636631) (← links)
- (Q4963995) (← links)