Potential Divisibility in Finite Semigroups is Undecidable

DOI10.1142/S0218196798000326zbMath0942.20039OpenAlexW2089737476MaRDI QIDQ4704561

S. I. Kublanovsky, Mark V. Sapir

Publication date: 13 August 2000

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196798000326

zbMATH Keywords

finite semigroupsdivisibility

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Undecidability and degrees of sets of sentences (03D35)

Related Items (5)

Minsky Machines and Algorithmic Problems ⋮ The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups ⋮ Undecidable problems for completely 0-simple semigroups. ⋮ Algorithmic problems for amalgams of finite semigroups ⋮ Undecidability of Algebras of Binary Relations

Cites Work

• Algorithmic problems for finite groups and finite \(0\)-simple semigroups
• Eventually \({\mathcal H}\)-related sets and systems of equations over finite semigroups and rings
• ALGORITHMIC PROBLEMS IN VARIETIES
• The Word Problem for Abstract Algebras

This page was built for publication: Potential Divisibility in Finite Semigroups is Undecidable