Unification in partially commutative semigroups

DOI10.1007/BF00881887zbMath0812.68076OpenAlexW2089496816MaRDI QIDQ1337561

Edmund Kieran Burke

Publication date: 10 November 1994

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00881887

zbMATH Keywords

unification algorithmspartially commutative semigroups

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Unification in commutative semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification under associativity and idempotence is of type nullary
• The theory of idempotent semigroups is of unification type zero
• Unification in abelian semigroups
• Unification theory
• Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
• Minimal and complete word unification
• THE SOLVABILITY PROBLEM FOR EQUATIONS IN ONE UNKNOWN IN NILPOTENT GROUPS
• A Unification Algorithm for Associative-Commutative Functions
• The Undecidability of the Unification Problem for Nilpotent Groups of Class ⩾ 5
• Equation-Solving in Free Nilpotent groups Class 2 and 3
• Unification for nilpotent groups of class 2
• Solving word equations

This page was built for publication: Unification in partially commutative semigroups