Shirshov's theorem and \(\omega\)-permutability of semigroups

DOI10.1016/0001-8708(91)90069-JzbMath0743.20067OpenAlexW2063999757MaRDI QIDQ1175762

Giuseppe Pirillo, Jacques Justin

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0001-8708(91)90069-j

zbMATH Keywords

semigroupsfinite alphabet\(\omega\)- permutability\(n\)-divided factorizationlexicographically orderedShirshov's theoremtwo-sided infinite words

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (6)

On some factorizations of infinite words by elements of codes ⋮ Some combinatorial properties of infinite words and applications to semigroup theory ⋮ Unnamed Item ⋮ On a question about factorization forests ⋮ Intracommutativity properties for groups and semigroups ⋮ Monomial algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Burnside problem for semigroups
• Factorizations of free monoids and unavoidable regularities
• Some remarks on the permutation property for semigroups
• On a natural extension of Jacob's ranks
• Comments on the permutation property for semigroups
• A note on \(\omega\)-permutable semigroups
• Rewritable Products In Fc-By-Finite Groups

This page was built for publication: Shirshov's theorem and \(\omega\)-permutability of semigroups