ON THE BURNSIDE SEMIGROUPS xn = xn+m

DOI10.1142/S0218196796000106zbMath0857.20039MaRDI QIDQ4892457

Alair Pareira do Lago

Publication date: 9 January 1997

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

zbMATH Keywords

words; maximal subgroups; congruences; confluent rewriting systems; minimal generators; Burnside semigroups

Mathematics Subject Classification ID

68R15: Combinatorics on words

68Q45: Formal languages and automata

20M05: Free semigroups, generators and relations, word problems

20M35: Semigroups in automata theory, linguistics, etc.

68Q42: Grammars and rewriting systems

Related Items

PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY, LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES, General Idempotency Languages Over Small Alphabets, On a variety of Burnside ai-semirings satisfying \(x^n\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 the word problem for the free Burnside semigroups satisfying \(x^2=x^3\)., Obituary: Aldo de Luca 1941--2018, On the varieties of ai-semirings satisfying \({x^{3}\approx x}\), ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x²= x³, Free Burnside Semigroups