INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
From MaRDI portal
Publication:4786270
DOI10.1142/S0218196701000462zbMath1024.68064WikidataQ114857089 ScholiaQ114857089MaRDI QIDQ4786270
Publication date: 15 December 2002
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Quasivarieties and varieties of groups (20E10)
Related Items (24)
CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA ⋮ ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS ⋮ PROFINITE METHODS IN SEMIGROUP THEORY ⋮ COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY ⋮ Reducibility of pointlike problems ⋮ Pointlike sets and separation: a personal perspective ⋮ About the power pseudovariety \(\mathbf{PCS}\) ⋮ Pointlike sets for varieties determined by groups ⋮ Some reducibility properties for pseudovarieties of the form DRH ⋮ An upper bound for the power pseudovariety \(\mathbf{PCS}\). ⋮ Finite state automata: A geometric approach ⋮ Dynamics of implicit operations and tameness of pseudovarieties of groups ⋮ The pro-nilpotent group topology on a free group ⋮ A NEW PROOF OF THE RHODES TYPE II CONJECTURE ⋮ Every decidable pseudovariety of abelian groups is completely tame ⋮ Varieties of finite supersolvable groups with the M.~Hall property. ⋮ On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\) ⋮ Inverse automata and profinite topologies on a free group ⋮ The geometry of profinite graphs with applications to free groups and finite monoids ⋮ The pseudovariety of all nilpotent groups is tame ⋮ Profinite topologies ⋮ ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS ⋮ Characterizing level one in group-based concatenation hierarchies ⋮ On \(F\)-inverse covers of inverse monoids.
Cites Work
- Categories as algebra: An essential ingredient in the theory of monoids
- Topology of finite graphs
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Semidirect products of categories and applications
- Profinite groups and Boolean graphs
- Some results on the dot-depth hierarchy
- Abelian pointlikes of a monoid
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Locality of DS and associated varieties
- Profinite semigroups, Mal'cev products, and identities
- Lower bounds for complexity of finite semigroups
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- A Conjecture on the Hall Topology for the Free Group
- Undecidability of the identity problem for finite semigroups
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- Free Inverse Semigroups
- 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
- REDUCED FACTORIZATIONS IN FREE PROFINITE GROUPS AND JOIN DECOMPOSITIONS OF PSEUDOVARIETIES
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- On Pointlike Sets and Joins of Pseudovarieties
- A SYNTACTICAL PROOF OF LOCALITY OF DA
- Monoid kernels and profinite topologies on the free Abelian group
This page was built for publication: INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
