Pages that link to "Item:Q4596614"
From MaRDI portal
The following pages link to On the subword equivalence problem for infinite words (Q4596614):
Displaying 11 items.
- Nonexistence of a Kruskal-Katona type theorem for subword orders (Q705744) (← links)
- Coloring factors of substitutive infinite words (Q729779) (← links)
- Absoluteness of subword inequality is undecidable (Q764348) (← links)
- On the subword equivalence problem for morphic words (Q1363770) (← links)
- On the factors of automatic words (Q1392016) (← links)
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
- On subwords of infinite words (Q1917236) (← links)
- The equality problem for infinite words generated by primitive morphisms (Q2389351) (← links)
- Substitutions over infinite alphabet generating \((-\beta)\)-integers (Q2789521) (← links)
- (Q3409978) (← links)
- The Maximal Subword Complexity of Quasiperiodic Infinite Words (Q4964023) (← links)