THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING Tm=Tm+n WITH m≥3
From MaRDI portal
Publication:4286027
DOI10.1142/S0218196793000226zbMath0818.20070MaRDI QIDQ4286027
Publication date: 14 August 1995
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, LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES, A solution of the word problem for free \(^*\)-regular semigroups, General Idempotency Languages Over Small Alphabets, 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