On the complexity of properties of partial bijection semigroups

DOI10.1016/J.IC.2026.105450MaRDI QIDQ7286051zbMATH OpenFDO

Authors Trevor Jack

Publication date 23 June 2026

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2026.105450

Mathematics Subject Classification ID

Inverse semigroups (20M18) Semigroups of transformations, relations, partitions, etc. (20M20) Analysis of algorithms and problem complexity (68Q25)

Cites work

• Complexity of the identity checking problem for finite semigroups.
• Computing finite semigroups
• Domino-tiling games
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 789816 (Why is no real title available?)
• On the complexity of inverse semigroup conjugacy
• The undecidability of the domino problem
• Two-letter group codes that preserve aperiodicity of inverse finite automata.

This page was built for publication: On the complexity of properties of partial bijection semigroups

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