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
DOI10.1142/S021819679300010XzbMath0783.20034MaRDI QIDQ3141772
Publication date: 1 November 1993
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
20M05: Free semigroups, generators and relations, word problems
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
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, Unified theory for finite Markov chains, On the word problem for the free Burnside semigroups satisfying \(x^2=x^3\)., 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 x2= x3, Free Burnside Semigroups, FURTHER RESULTS ON MONOIDS ACTING ON TREES