THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING Tm=Tm+n WITH m≥4 OR m=3, n=1
From MaRDI portal
Publication:3141772
Recommendations
- THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING Tm=Tm+n WITH m≥3
- Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x^2=x^3.
- THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING Ta = Ta+b WITH a ≥ 6
- On the word problem for the free Burnside semigroups satisfying x^2=x^3.
- The word problem for relatively free semigroups.
Cited in
(17)- Unified theory for finite Markov chains
- On the word problem for the free Burnside semigroups satisfying x^2=x^3.
- Linear equations and regularity conditions on semigroups.
- Low-dimensional (co)homology of free Burnside monoids
- Obituary: Aldo de Luca 1941--2018
- Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x^2=x^3.
- Free Burnside Semigroups
- Further results on monoids acting on trees.
- THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING Ta = Ta+b WITH a ≥ 6
- scientific article; zbMATH DE number 4171232 (Why is no real title available?)
- scientific article; zbMATH DE number 1189234 (Why is no real title available?)
- scientific article; zbMATH DE number 1342157 (Why is no real title available?)
- THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING Tm=Tm+n WITH m≥3
- PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
- NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
- LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES
- ON THE BURNSIDE SEMIGROUPS xn = xn+m
This page was built for publication: THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING Tm=Tm+n WITH m≥4 OR m=3, n=1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141772)