The following pages link to (Q5144688):
Displaying 19 items.
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
- Complexity in Young's lattice (Q2668002) (← links)
- Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
- Absent subsequences in words (Q2695493) (← links)
- A note on the decidability of subword inequalities (Q2856016) (← links)
- Theories of orders on the set of words (Q3374756) (← links)
- Definability in the Subword Order (Q3576212) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- The Subtrace Order and Counting First-Order Logic (Q5042249) (← links)
- (Q5089232) (← links)
- (Q5376657) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Unboundedness problems for machines with reversal-bounded counters (Q6091196) (← links)
- Ranking and Unranking k-Subsequence Universal Words (Q6134861) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
