ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
DOI10.1142/S0218196791000298zbMATH Open0791.20079OpenAlexW2167010548MaRDI QIDQ4024640FDOQ4024640
Authors: Karsten Henckell, Jean-Éric Pin, S. W. Margolis, John L. Rhodes
Publication date: 8 February 1993
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196791000298
Recommendations
free groupsfinite semigroupsfinite monoidsfree monoidssemigroup varietiesMalcev productsprofinite topologytype II conjecture
Limits, profinite groups (20E18) Algebraic theory of languages and automata (68Q70) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (66)
- Block-Groups and Hall Relations
- Representations of relatively free profinite semigroups, irreducibility, and order primitivity
- On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\)
- ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS
- PROFINITE METHODS IN SEMIGROUP THEORY
- NORMALLY ORDERED SEMIGROUPS
- Pointlike sets and separation: a personal perspective
- PROFINITE TOPOLOGIES IN FREE PRODUCTS OF GROUPS
- ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- The geometry of profinite graphs with applications to free groups and finite monoids
- John Rhodes and the theory of finite semigroups.
- Varieties of finite supersolvable groups with the M.~Hall property.
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- POLYNOMIAL CLOSURE AND TOPOLOGY
- On an algorithm to decide whether a free group is a free factor of another
- Polynomial closure of group languages and open sets of the Hall topology
- On a locality-like property of the pseudovariety J
- A profinite approach to stable pairs.
- Reducibility of pointlike problems
- On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties.
- COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY
- An upper bound for the power pseudovariety \(\mathbf{PCS}\).
- ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC
- ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS
- On the complexity of computing the profinite closure of a rational language
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- About the power pseudovariety \(\mathbf{PCS}\)
- Monoid kernels and profinite topologies on the free Abelian group
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- Inverse automata and profinite topologies on a free group
- A NEW PROOF OF THE RHODES TYPE II CONJECTURE
- On Pointlike Sets and Joins of Pseudovarieties
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- A note on the power semigroup of a completely simple semigroup.
- SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS
- Polynomial closure of group languages and open sets of the Hall topology
- Pointlike sets with respect to R and J.
- An application of a theorem of Ash to finite covers.
- Relative Abelian kernels of some classes of transformation monoids
- Pointlike sets for varieties determined by groups
- A constructive version of the Ribes-Zalesskiĭ product theorem.
- CATEGORIES AS ALGEBRA, II
- Krohn-Rhodes complexity pseudovarieties are not finitely based
- Closures of regular languages for profinite topologies.
- Conjugacy separability of 1-acylindrical graphs of free groups.
- Polynomial closure and unambiguous product
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- Irreducibility of certain pseudovarieties1
- COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- New results on the conjecture of Rhodes and on the topological conjecture
- Constructing divisions into power groups
- Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids
- POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS
- Commutative images of rational languages and the Abelian kernel of a monoid
- A conjecture on the concatenation product
- An effective lower bound for group complexity of finite semigroups and automata
- Finite state automata: a geometric approach
- SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS
- Covers for regular semigroups and an application to complexity
- Computing relative Abelian kernels of finite monoids.
- SC-hyperdecidability of \(\mathbf R\)
- Characterizing level one in group-based concatenation hierarchies
- Type II theorem and hyperdecidability of pseudovarieties of groups
- The pro-nilpotent group topology on a free group
This page was built for publication: ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024640)