Linear computation of unbordered conjugate on unordered alphabet

DOI10.1016/j.tcs.2013.12.008zbMath1279.68280OpenAlexW2046279715MaRDI QIDQ393901

Thierry Lecroq, Arnaud Lefebvre, Jean-Pierre Duval

Publication date: 24 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.008

zbMATH Keywords

combinatorics on wordsunordered alphabetconjugateborderunbordered word

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15)

Related Items (4)

Finding the leftmost critical factorization on unordered alphabet ⋮ On Maximal Unbordered Factors ⋮ Unnamed Item ⋮ Site-directed insertion: language equations and decision problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Periodicity and unbordered segments of words
• Lexicographically least circular substrings
• Relationship between the period of a finite word and the length of its unbordered segments
• Optimal canonization of all substrings of a string
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Factorizing words over an ordered alphabet
• Periodicity and unbordered words
• Fast canonization of circular strings
• Rotations of Periodic Strings and Short Superstrings
• STACS 2004
• Uniqueness Theorems for Periodic Functions
• Algorithms on Strings

This page was built for publication: Linear computation of unbordered conjugate on unordered alphabet