ON THE BURNSIDE SEMIGROUPS xn = xn+m

DOI10.1142/S0218196796000106zbMath0857.20039OpenAlexW1996553418MaRDI QIDQ4892457

Alair Pareira do Lago

Publication date: 9 January 1997

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196796000106

zbMATH Keywords

wordsmaximal subgroupscongruencesconfluent rewriting systemsminimal generatorsBurnside semigroups

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)

Related Items

LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES ⋮ On the varieties of ai-semirings satisfying \({x^{3}\approx x}\) ⋮ The varieties of semilattice-ordered semigroups satisfying \(x^3\equiv x\) and \(xy\equiv yx\) ⋮ Unified theory for finite Markov chains ⋮ On some varieties of ai-semirings satisfying \(x^{p+1} \approx x\) ⋮ On a variety of Burnside ai-semirings satisfying \(x^n\approx x\) ⋮ On the word problem for the free Burnside semigroups satisfying \(x^2=x^3\). ⋮ General Idempotency Languages Over Small Alphabets ⋮ ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x²= x³ ⋮ PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY ⋮ Obituary: Aldo de Luca 1941--2018 ⋮ Free Burnside Semigroups