Undecidable problems for completely 0-simple semigroups.
From MaRDI portal
Publication:1025071
DOI10.1016/j.jpaa.2009.02.011zbMath1179.20052OpenAlexW1975682685MaRDI QIDQ1025071
Marcel Jackson, Mikhail V. Volkov
Publication date: 18 June 2009
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpaa.2009.02.011
word problemfinite semigroupscompletely 0-simple semigroupsdecidabilitypseudovarietiesfinite regular semigroupsalgorithmic solvabilityfinite membership problem
Semigroups of transformations, relations, partitions, etc. (20M20) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Regular semigroups (20M17)
Related Items
Rees semigroups of digraphs for classification of data. ⋮ Classification systems based on combinatorial semigroups ⋮ Undecidability of representability as binary relations ⋮ Natural dualities, nilpotence and projective planes ⋮ OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA ⋮ Optimization of classifiers for data mining based on combinatorial semigroups ⋮ \(\aleph_0\)-categoricity of semigroups. II. ⋮ Internet security applications of the Munn rings ⋮ Undecidability of Algebras of Binary Relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unsolvability of the universal theory of finite groups
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- Algorithmic problems for amalgams of finite semigroups
- Decidability of finite quasivarieties generated by certain transformation semigroups.
- Eventually \({\mathcal H}\)-related sets and systems of equations over finite semigroups and rings
- Relatively inherently nonfinitely q-based semigroups
- Some undecidable embedding problems for finite semigroups
- Potential Divisibility in Finite Semigroups is Undecidable
- A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive
- ALGORITHMIC PROBLEMS IN VARIETIES
- FAITHFUL FUNCTORS FROM CANCELLATIVE CATEGORIES TO CANCELLATIVE MONOIDS WITH AN APPLICATION TO ABUNDANT SEMIGROUPS
- A Finitely Generated Infinite Simple Group
- Embeddability and the Word Problem
- Quasigroups. I
