Rewrite systems for varieties of semigroups

DOI10.1007/3-540-52885-7_102zbMath1509.68113MaRDI QIDQ6488547

Franz Baader

Publication date: 28 April 2023

Mathematics Subject Classification ID

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

Related Items (2)

More problems in rewriting ⋮ Problems in rewriting III

Cites Work

• Unnamed Item
• Unnamed Item
• A note on a special one-rule semi-Thue system
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• A Noetherian and confluent rewrite system for idempotent semigroups
• About the rewriting systems produced by the Knuth-Bendix completion algorithm
• The lattice of equational classes of idempotent semigroups
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A note on special thue systems with a single defining relation
• All Varieties of Bands I

This page was built for publication: Rewrite systems for varieties of semigroups