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

DOI10.1142/S0218196793000226zbMATH Open0818.20070OpenAlexW2011163517MaRDI QIDQ4286027FDOQ4286027

Authors: 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

Recommendations

• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥4 OR m=3, n=1
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• The word problem for relatively free semigroups.
• scientific article; zbMATH DE number 459344
• On the word problem for the free Burnside semigroups satisfying \(x^2=x^3\).
• A solution of the word problem for free \(^*\)-regular semigroups
• On the word problem for free completely regular semigroups
• The word problem for free adequate semigroups.
• A group-theoretical interpretation of the word problem for free idempotent generated semigroups
• scientific article; zbMATH DE number 1560302

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)

Cited In (17)

• Obituary: Aldo de Luca 1941--2018
• Almost overlap-free words and the word problem for the free Burnside semigroup satisfying \(x^2=x^3\).
• On Brzozowski's conjecture for the free Burnside semigroup satisfying \(x ^{2} = x ^{3}\)
• The word problem for relatively free semigroups.
• General idempotency languages over small alphabets
• Free Burnside Semigroups
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥4 OR m=3, n=1
• Low-dimensional (co)homology of free Burnside monoids
• On the word problem for the free Burnside semigroups satisfying \(x^2=x^3\).
• ON THE BURNSIDE SEMIGROUPS xⁿ = x^n+m
• On noncounting regular classes
• A solution of the word problem for free \(^*\)-regular semigroups
• LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unified theory for finite Markov chains

This page was built for publication: THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286027)