Linear computation of unbordered conjugate on unordered alphabet

DOI10.1016/J.TCS.2013.12.008zbMATH Open1279.68280OpenAlexW2046279715MaRDI QIDQ393901FDOQ393901

Authors: Thierry Lecroq, A. Lefebvre, J.-P. 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

Recommendations

• Unbordered partial words
• scientific article; zbMATH DE number 3842140
• Factorizing words over an ordered alphabet
• On maximal unbordered factors
• STACS 2004

zbMATH Keywords

combinatorics on wordsunordered alphabetconjugateborderunbordered word

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Title not available (Why is that?)
• Factorizing words over an ordered alphabet
• Uniqueness Theorems for Periodic Functions
• Algorithms on Strings
• Rotations of Periodic Strings and Short Superstrings
• 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
• Periodicity and unbordered words
• Fast canonization of circular strings
• Title not available (Why is that?)
• STACS 2004
• Periodicity and unbordered segments of words

Cited In (6)

• On maximal unbordered factors
• Finding the leftmost critical factorization on unordered alphabet
• Computing the Longest Unbordered Substring
• Bordered conjugates of words over large alphabets
• Longest unbordered factor in quasilinear time
• Site-directed insertion: language equations and decision problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393901)