Deciding Associativity for Partial Multiplication Tables of Order 3

DOI10.2307/2006168MaRDI QIDQ4172914zbMATH OpenOpenAlexFDO

Authors Paul W. Bunting, J. Van Leeuwen, Dov Tamari

Publication date 1978

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2006168

zbMATH Keywords

AssociativityMultiplication TablesSemigroupsWord Problems

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Software, source code, etc. for problems pertaining to combinatorics (05-04) Free semigroups, generators and relations, word problems (20M05) Symbolic computation and algebraic computation (68W30)

Cited in

(4)

• Computers in semigroups
• Deciding embeddability of partial groupoids into semigroups
• Symmetrisations of semigroups
• Malcev sequences and associative symmetrisations

This page was built for publication: Deciding Associativity for Partial Multiplication Tables of Order 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4172914)