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

DOI10.1016/0012-365X(84)90092-XzbMATH Open0555.05005MaRDI QIDQ760429FDOQ760429

Authors: J. Justin, Giuseppe Pirillo 

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

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

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)

Cites Work

• Characterization of the repetitive commutative semigroups
• Generalisation du theoreme de van der Waerden sur les semi-groupes repetitifs
• Title not available (Why is that?)

Cited In (10)

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

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)