Two combinatorial properties of partitions of the free semigroup into finitely many parts

DOI10.1016/0012-365X(84)90092-XMaRDI QIDQ760429zbMATHFDO

Authors J. Justin, Giuseppe Pirillo

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitions of finite semigroupsrepetitive mapstrongly repetitive semigroupsuniformly repetitive semigroups

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of partitions of integers (05A17) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• On uniformly repetitive semigroups
• COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS
• scientific article; zbMATH DE number 3922981
• scientific article; zbMATH DE number 55914
• Repetitivity of semigroups and a result of Cassaigne, Currie, Schaeffer and Shallit

Cites work

• scientific article; zbMATH DE number 3183061 (Why is no real title available?)
• Characterization of the repetitive commutative semigroups
• Generalisation du theoreme de van der Waerden sur les semi-groupes repetitifs

Cited in

(10)

• On uniformly repetitive semigroups
• Factorization forests of finite height
• On a question about factorization forests
• On some questions and conjectures in the combinatorial theory of semigroups
• On a natural extension of Jacob's ranks
• Properties of integers and finiteness conditions for semigroups
• Coloring factors of substitutive infinite words
• scientific article; zbMATH DE number 3922981 (Why is no real title available?)
• A combinatorial theorem on $p$-power-free words and an application to semigroups
• Zebra factorizations in free semigroups.

This page was built for publication: Two combinatorial properties of partitions of the free semigroup into finitely many parts

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