Viennot factorization of infinite words (Q1350922): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Sturmian words, Lyndon words and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free differential calculus. IV: The quotient groups of the lower central series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Hall trees and Hall words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon factorization of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon factorization of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3986721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Lyndon words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of free monoids and unavoidable regularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5665310 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00147-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052341580 / rank
 
Normal rank

Latest revision as of 10:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Viennot factorization of infinite words
scientific article

    Statements