THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING Ta = Ta+b WITH a ≥ 6

DOI10.1142/S021819679100002XzbMath0732.20034OpenAlexW2041507263MaRDI QIDQ3358946

No author found.

Publication date: 1991

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

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

zbMATH Keywords

presentationmaximal subgroupsfinite automatonalphabetGreen relationdecidable word problemBurnside semigroups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, etc. in computability and recursion theory (03D40)

Related Items (20)

Semigroups satisfying x m+n = x n ⋮ 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 ⋮ McCammond’s normal forms for free aperiodic semigroups revisited ⋮ Iterated periodicity over finite aperiodic semigroups ⋮ A GENERAL SMALL CANCELLATION THEORY ⋮ Algebraic and topological theory of languages ⋮ Unified theory for finite Markov chains ⋮ On the word problem for the free Burnside semigroups satisfying \(x^2=x^3\). ⋮ General Idempotency Languages Over Small Alphabets ⋮ Pro-aperiodic monoids via saturated models ⋮ 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 ⋮ Generalized noncrossing partitions and combinatorics of Coxeter groups ⋮ Join irreducible semigroups ⋮ Obituary: Aldo de Luca 1941--2018 ⋮ On finitely recognizable semigroups ⋮ Free Burnside Semigroups

This page was built for publication: THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6