Viennot factorization of infinite words

DOI10.1016/S0020-0190(96)00147-0zbMath1023.68650OpenAlexW2052341580MaRDI QIDQ1350922

Guy 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

combinatorial problemsformal languages

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

On some factorizations of infinite words by elements of codes ⋮ Transfinite Lyndon Words ⋮ Unnamed Item ⋮ Lyndon words and singular factors of sturmian words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorizations of free monoids and unavoidable regularities
• Combinatorics of Hall trees and Hall words
• Infinite Lyndon words
• Sturmian words, Lyndon words and trees
• Lyndon factorization of Sturmian words
• Factorizing words over an ordered alphabet
• Lyndon factorization of infinite words
• Free differential calculus. IV: The quotient groups of the lower central series

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