A solution of the word problem for free \(^*\)-regular semigroups

DOI10.1016/S0022-4049(00)00011-6zbMath0981.20048OpenAlexW2056245211MaRDI QIDQ5928478

Libor Polák

Publication date: 18 March 2002

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(00)00011-6

zbMATH Keywords

canonical formsfree semigroupsfree \(^*\)-regular semigroupsfree involutory semigroupsinvolutory semigroupslocally confluent relations

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Related Items (7)

Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals ⋮ Obituary: Libor Polák (1950--2020) ⋮ On groups generated by involutions of a semigroup. ⋮ A common framework for restriction semigroups and regular \(*\)-semigroups. ⋮ A groupoid approach to regular \(\ast \)-semigroups ⋮ Varieties ofP-Restriction Semigroups ⋮ Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups

Cites Work

• Two-way automaton computations
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥3
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A solution of the word problem for free \(^*\)-regular semigroups