ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS

DOI10.1142/S0218196701000802zbMath1026.20039MaRDI QIDQ4786305

Manuel Delgado

Publication date: 15 December 2002

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

zbMATH Keywords

finite semigroups; profinite groups; pseudovarieties of groups; hyperdecidability; Rhodes type II conjecture

Mathematics Subject Classification ID

20M07: Varieties and pseudovarieties of semigroups

68Q70: Algebraic theory of languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

20E10: Quasivarieties and varieties of groups

20E18: Limits, profinite groups

Related Items

PROFINITE METHODS IN SEMIGROUP THEORY, COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY, SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS, TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS, On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\), Finite state automata: A geometric approach, Dynamics of implicit operations and tameness of pseudovarieties of groups

Cites Work

• E-unitary inverse monoids and the Cayley graph of a group presentation
• Topologies for the free monoid
• Abelian pointlikes of a monoid
• Improved lower bounds for the complexity of finite semigroups
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• A topological approach to a conjecture of Rhodes
• A Conjecture on the Hall Topology for the Free Group
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• On the hyperdecidability of semidirect products of pseudovarieties
• On The Profinite Topology on a Free Group
• THE PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
• The pseudovariety $J$ is hyperdecidable
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY