A Noetherian and confluent rewrite system for idempotent semigroups

DOI10.1007/BF02573590zbMath0493.68087MaRDI QIDQ1168754

S. Singh

Publication date: 1982

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134565

zbMATH Keywords

bandterm rewriting systemsChurch-Rosser- Propertydecision procedure for word equalityreplacement rulesterminating replacement systemunique normal form for words

Mathematics Subject Classification ID

Artificial intelligence (68T99) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (16)

Semigroups satisfying x m+n = x n ⋮ Unification in varieties of idempotent semigroups ⋮ Free bands and free *-bands ⋮ History and basic features of the critical-pair/completion procedure ⋮ Unification theory ⋮ Conditional semi-Thue systems for presenting monoids ⋮ Polynomial time multiplication and normal forms in free bands ⋮ What Is Essential Unification? ⋮ Rewriting in Varieties of Idempotent Semigroups ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ Expressivity of coalgebraic modal logic: the limits and beyond ⋮ Essential unifiers ⋮ The theory of idempotent semigroups is of unification type zero ⋮ On free products of bands ⋮ Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups ⋮ Relatively free bands

Cites Work

• New decision algorithms for finitely presented commutative semigroups
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Abstract data types and software validation
• Idempotent Semigroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Noetherian and confluent rewrite system for idempotent semigroups