Factorizations of free monoids and unavoidable regularities

DOI10.1016/0304-3975(90)90163-CzbMath0695.68057OpenAlexW1981855662WikidataQ114214847 ScholiaQ114214847MaRDI QIDQ910247

Stefano Varricchio

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90163-c

zbMATH Keywords

factorizationscombinatorics on words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Enumerative combinatorics (05A99) Rings with polynomial identity (16Rxx)

Related Items

On some factorizations of infinite words by elements of codes, Viennot factorization of infinite words, Some combinatorial properties of infinite words and applications to semigroup theory, Shirshov's theorem and \(\omega\)-permutability of semigroups, Stefano Varricchio (1960-2008), A note on \(\omega\)-permutable semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interesting combinatorial method in the theory of locally finite semigroups
• Codes limites et factorisations finies du monoïde libre
• On a Factorisation of Free Monoids