Some combinatorial properties of infinite words and applications to semigroup theory

DOI10.1016/0012-365X(95)00140-RzbMath0852.20046OpenAlexW2040224306MaRDI QIDQ1917528

Giuseppe Pirillo, Stefano Varricchio

Publication date: 8 December 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00140-r

zbMATH Keywords

periodic semigroupsfinitely generated semigroupsRamsey's Theorempermutable semigroups\(\omega\)-iteration propertybi-ideal sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05)

Related Items (1)

Stefano Varricchio (1960-2008)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Burnside problem for semigroups
• Factorizations of free monoids and unavoidable regularities
• Rational languages and the Burnside problem
• Notes on finitely generated semigroups and pumping conditions for regular languages
• On a natural extension of Jacob's ranks
• A finiteness condition for semigroups generalizing a theorem of Hotzel
• Shirshov's theorem and \(\omega\)-permutability of semigroups
• Finiteness and iteration conditions for semigroups
• Some conditions on the product of two elements of a semigroup
• Some applications of a theorem of Shirshov to language theory
• Poincaré recurrence and number theory
• COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• A finiteness condition for finitely generated semigroups

This page was built for publication: Some combinatorial properties of infinite words and applications to semigroup theory