Viennot factorization of infinite words
type: Item
instance of: scholarly article
title: Viennot factorization of infinite words
zbMATH Open document ID: 1023.68650
DOI: 10.1016/S0020-0190(96)00147-0
author: G. Melançon
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 984201
zbMATH Keywords: combinatorial problems
zbMATH Keywords: formal languages
MaRDI profile type: Publication
cites work: Sturmian words, Lyndon words and trees
cites work: Free differential calculus. IV: The quotient groups of the lower central series
cites work: Factorizing words over an ordered alphabet
cites work: Q3659988
cites work: Combinatorics of Hall trees and Hall words
cites work: Lyndon factorization of infinite words
cites work: Lyndon factorization of Sturmian words
cites work: Q3986721
cites work: Q3754625
cites work: Infinite Lyndon words
cites work: Factorizations of free monoids and unavoidable regularities
cites work: Q5665310
full work available at URL: s0020-0190(96)00147-0
OpenAlex ID: W2052341580
description: scientific article; zbMATH DE number 984201