Pages that link to "Item:Q1159466"
From MaRDI portal
The following pages link to Relationship between the period of a finite word and the length of its unbordered segments (Q1159466):
Displaying 21 items.
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- A proof of the extended Duval's conjecture (Q557916) (← links)
- The Ehrenfeucht-Silberger problem (Q662035) (← links)
- Border correlation of binary words (Q703695) (← links)
- On the number of frames in binary words (Q719267) (← links)
- Unbordered partial words (Q1028413) (← links)
- A classical analogue of Yukawa coupling: Presymplectic formalism (Q1102589) (← links)
- Biinfinite words with maximal recurrent unbordered factors. (Q1401214) (← links)
- Studies on finite Sturmian words (Q2354408) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- Unbordered factors and Lyndon words (Q2483406) (← links)
- Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
- On Maximal Unbordered Factors (Q2942272) (← links)
- MINIMAL DUVAL EXTENSIONS (Q3022004) (← links)
- INVOLUTIVELY BORDERED WORDS (Q3065618) (← links)
- On the Relation between Periodicity and Unbordered Factors of Finite Words (Q3533028) (← links)
- ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS (Q3586408) (← links)
- A Note on a Conjecture of Duval and Sturmian Words (Q4800262) (← links)
- (Q5091065) (← links)
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS (Q5401556) (← links)
- Maximal unbordered factors of random strings (Q5916287) (← links)
