ON THE BURNSIDE SEMIGROUPS xn = xn+m

DOI10.1142/S0218196796000106MaRDI QIDQ4892457zbMATH OpenOpenAlexFDO

Authors 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

Burnside semigroupsconfluent rewriting systemscongruencesmaximal subgroupsminimal generatorswords

Mathematics Subject Classification ID

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

Recommendations

• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• Programs over aperiodic monoids
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥3
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥4 OR m=3, n=1
• Periodic D0L languages
• Sul problema di Burnside per i semigruppi e i linguaggi
• The equations h(w)=w^ n in binary alphabets
• COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS
• scientific article; zbMATH DE number 1259068

Cited in

(22)

• Complete systems of \(\mathcal B\)-rational identities
• On a conjecture of Brown
• 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}\)
• Overlap-free words and the free Burnside semigroup with two generators satisfying the identity \(x^2=x^3\).
• Thue-Morse words and the \(\mathcal D\)-structure of the free Burnside semigroup
• Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x^2=x^3.
• Free Burnside Semigroups
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• Sul problema di Burnside per i semigruppi e i linguaggi
• scientific article; zbMATH DE number 3753115 (Why is no real title available?)
• scientific article; zbMATH DE number 177804 (Why is no real title available?)
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
• LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES
• Varieties of Burnside ai-semirings satisfying xn ≈ x
• On a variety of Burnside ai-semirings satisfying \(x^n\approx x\)
• On Brzozowski's conjecture for the free Burnside semigroup satisfying \(x ^{2} = x ^{3}\)
• General idempotency languages over small alphabets

This page was built for publication: ON THE BURNSIDE SEMIGROUPS xⁿ = x^n+m

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4892457)