The following pages link to STACS 2004 (Q5309708):
Displaying 13 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)
- On periodic properties of circular words (Q897316) (← links)
- Bond-free DNA language classes (Q2461298) (← links)
- Unbordered factors and Lyndon words (Q2483406) (← links)
- A multidimensional critical factorization theorem (Q2581347) (← links)
- On the Relation between Periodicity and Unbordered Factors of Finite Words (Q3533028) (← links)
- (Q3567789) (← links)
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (Q3618580) (← links)
- (Q4015745) (← links)
- A Note on a Conjecture of Duval and Sturmian Words (Q4800262) (← links)
- (Q5443173) (← links)