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.20034OpenAlexW2002178297MaRDI QIDQ3141772
Publication date: 1 November 1993
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021819679300010x
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (10)
NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS ⋮ LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES ⋮ FURTHER RESULTS ON MONOIDS ACTING ON TREES ⋮ Low-dimensional (co)homology of free Burnside monoids ⋮ Unified theory for finite Markov chains ⋮ On the word problem for the free Burnside semigroups satisfying \(x^2=x^3\). ⋮ ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x2= x3 ⋮ PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY ⋮ Obituary: Aldo de Luca 1941--2018 ⋮ Free Burnside Semigroups
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