The following pages link to (Q2708966):
Displayed 17 items.
- Relations on words (Q505060) (← links)
- Some characterizations of Parikh matrix equivalent binary words (Q834899) (← links)
- On highly palindromic words (Q1028422) (← links)
- Reconstruction from subsequences. (Q1406745) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- Spectral concepts in genome informational analysis (Q2243578) (← links)
- Parikh matrices for powers of words (Q2317835) (← links)
- Core words and Parikh matrices (Q2342671) (← links)
- Connections between subwords and certain matrix mappings (Q2484434) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- Separating the Words of a Language by Counting Factors (Q5158654) (← links)
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations (Q5164858) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
- Counting subwords in circular words and their Parikh matrices (Q6185846) (← links)