THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING Tm=Tm+n WITH m≥3

DOI10.1142/S0218196793000226zbMath0818.20070OpenAlexW2011163517MaRDI QIDQ4286027

Victor S. Guba

Publication date: 14 August 1995

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196793000226

zbMATH Keywords

word problemregular languagesrelatively free Burnside semigroups

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (10)

LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES ⋮ Low-dimensional (co)homology of free Burnside monoids ⋮ Unified theory for finite Markov chains ⋮ A solution of the word problem for free \(^*\)-regular semigroups ⋮ On the word problem for the free Burnside semigroups satisfying \(x^2=x^3\). ⋮ General Idempotency Languages Over Small Alphabets ⋮ ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x²= x³ ⋮ 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 T^m=T^m+n WITH m≥3