Viennot factorization of infinite words

DOI10.1016/S0020-0190(96)00147-0MaRDI QIDQ1350922zbMATH OpenOpenAlexFDO

Authors G. Melançon

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(96)00147-0

zbMATH Keywords

formal languagescombinatorial problems

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Lyndon factorization of infinite words
• Reprint of: ``Generalized Lyndon factorizations of infinite words
• -Lyndon words

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 4002102 (Why is no real title available?)
• scientific article; zbMATH DE number 29220 (Why is no real title available?)
• scientific article; zbMATH DE number 3397707 (Why is no real title available?)
• Combinatorics of Hall trees and Hall words
• Factorizations of free monoids and unavoidable regularities
• Factorizing words over an ordered alphabet
• Free differential calculus. IV: The quotient groups of the lower central series
• Infinite Lyndon words
• Lyndon factorization of Sturmian words
• Lyndon factorization of infinite words
• Sturmian words, Lyndon words and trees

Cited in

(8)

• Crochemore Factorization of Sturmian and Other Infinite Words
• Transfinite Lyndon words
• On some factorizations of infinite words by elements of codes
• Lyndon words and singular factors of sturmian words
• Transfinite Lyndon words
• Factorizations of free monoids and unavoidable regularities
• Lyndon factorization of infinite words
• Least Periods of Factors of Infinite Words

This page was built for publication: Viennot factorization of infinite words

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