Rewrite systems for varieties of semigroups
From MaRDI portal
Recommendations
Cites work
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- A finite Thue system with decidable word problem and without equivalent finite canonical system
- A Noetherian and confluent rewrite system for idempotent semigroups
- A note on a special one-rule semi-Thue system
- A note on special thue systems with a single defining relation
- About the rewriting systems produced by the Knuth-Bendix completion algorithm
- All Varieties of Bands I
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3413831 (Why is no real title available?)
- The lattice of equational classes of idempotent semigroups
Cited in
(10)- Rewriting systems over similarity and generalized pseudometric spaces and their properties
- Algebras defined by equations
- Reduction relations for monoid semirings
- Rewriting in varieties of idempotent semigroups
- IDENTITIES IN THE ALGEBRA OF PARTIAL MAPS
- Using groups for investigating rewrite systems
- More problems in rewriting
- Problems in rewriting III
- Rewriting system of certain semigroups with three generators
- Finite complete rewriting systems for regular semigroups.
This page was built for publication: Rewrite systems for varieties of semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488547)
