The following pages link to Words and special factors (Q5941274):
Displayed 20 items.
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- On a conjecture about finite fixed points of morphisms (Q557920) (← links)
- Some characterizations of Parikh matrix equivalent binary words (Q834899) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- Subword conditions and subword histories (Q859831) (← links)
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words (Q895104) (← links)
- Reconstruction of a word from a multiset of its factors (Q930915) (← links)
- On highly palindromic words (Q1028422) (← links)
- Words and forbidden factors (Q1605329) (← links)
- A combinatorial property of the factor poset of a word (Q1847375) (← links)
- Semiperiodic words and root-conjugacy. (Q1853735) (← links)
- Uniform words (Q1883404) (← links)
- Languages with mismatches (Q2456367) (← links)
- Connections between subwords and certain matrix mappings (Q2484434) (← links)
- Word assembly through minimal forbidden words (Q2503298) (← links)
- Efficient Reconstruction of RC-Equivalent Strings (Q3000522) (← links)
- On the Suffix Automaton with Mismatches (Q3503902) (← links)
- On the distribution of characteristic parameters of words (Q4800266) (← links)
- On the distribution of characteristic parameters of words II (Q4800267) (← links)