Generalized Lyndon factorizations of infinite words

DOI10.1016/j.tcs.2019.11.003zbMath1458.68149arXiv1905.04746OpenAlexW2978533670WikidataQ114129163 ScholiaQ114129163MaRDI QIDQ5919346

Amanda Burcroff, Eric Winsor

Publication date: 29 January 2020

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

Full work available at URL: https://arxiv.org/abs/1905.04746

zbMATH Keywords

infinite wordLyndon wordLyndon factorizationgeneralized lexicographic orderinfinite generalized Lyndon wordunique nonincreasing Lyndon factorization

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Reprint of: ``\(\omega\)-Lyndon words ⋮ Reprint of: ``Generalized Lyndon factorizations of infinite words ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ \( \omega \)-Lyndon words ⋮ Generalized Lyndon factorizations of infinite words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numeration and enumeration
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Infinite Lyndon words
• Inverse Lyndon words and inverse Lyndon factorizations of words
• \( \omega \)-Lyndon words
• Nyldon words
• On generalized Lyndon words
• Generalized Lyndon words
• Transfinite Lyndon Words
• On Burnside's Problem
• Free differential calculus. IV: The quotient groups of the lower central series
• Generalized Lyndon factorizations of infinite words

This page was built for publication: Generalized Lyndon factorizations of infinite words