POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS

DOI10.1142/S021819679900028XzbMath1027.20039MaRDI QIDQ4513300

Benjamin Steinberg, John L. Rhodes

Publication date: 7 November 2000

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

zbMATH Keywords

pointlike setsnilpotent semigroupspseudovarieties of finite semigroupsidentity problemdecidable membership

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Products, amalgamated products, and other kinds of limits and colimits (08B25)

Related Items

INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY ⋮ Pointlike sets and separation: a personal perspective ⋮ Pointlike sets for varieties determined by groups ⋮ An automata-theoretic approach to the word problem for \(\omega\)-terms over R ⋮ John Rhodes and the theory of finite semigroups. ⋮ Finite state automata: A geometric approach ⋮ Pointlike sets with respect to R and J. ⋮ STABLE PAIRS ⋮ The geometry of profinite graphs with applications to free groups and finite monoids ⋮ Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes

Cites Work

• Pointlike sets: the finest aperiodic cover of a finite semigroup
• Profinite semigroups, Mal'cev products, and identities
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• Undecidability of the identity problem for finite semigroups
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• On Pointlike Sets and Joins of Pseudovarieties