Pages that link to "Item:Q4406307"
From MaRDI portal
The following pages link to The expressibility of languages and relations by word equations (Q4406307):
Displaying 22 items.
- Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) (← links)
- Bad news on decision problems for patterns (Q1049406) (← links)
- Multiple factorizations of words and defect effect (Q1605328) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
- A logic for document spanners (Q2322723) (← links)
- On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
- The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
- Equations in the Partial Semigroup of Words with Overlapping Products (Q3166946) (← links)
- ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS (Q3503102) (← links)
- Bad News on Decision Problems for Patterns (Q3533022) (← links)
- (Q5028423) (← links)
- (Q5091271) (← links)
- (Q5092406) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- (Q5136316) (← links)
- Graph Logics with Rational Relations (Q5278208) (← links)
- Solving string constraints using SAT (Q6535533) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
- On the structure of solution-sets to regular word equations (Q6614609) (← links)
- Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)