INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
From MaRDI portal
Publication:3209328
Recommendations
Cited in
(only showing first 100 items - show all)- Krohn-Rhodes complexity of Brauer type semigroups.
- Iterated periodicity over finite aperiodic semigroups
- Extending partial automorphisms and the profinite topology on free groups
- Graph expansions of unipotent monoids
- UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS
- Covers for monoids.
- On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\)
- Pointlike sets and separation: a personal perspective
- PROFINITE METHODS IN SEMIGROUP THEORY
- Towards a pseudoequational proof theory
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
- All about unambiguous polynomial closure
- The geometry of profinite graphs with applications to free groups and finite monoids
- Finitely approximable groups and actions. I: The Ribes-Zalesskiĭ property
- MODULES
- On \(\kappa\)-reducibility of pseudovarieties of the form \(V \ast D\)
- John Rhodes and the theory of finite semigroups.
- Algebras of right ample semigroups
- A unified syntactical approach to theorems of Putcha, Margolis, and Straubing on finite power semigroups
- Every decidable pseudovariety of abelian groups is completely tame
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- POLYNOMIAL CLOSURE AND TOPOLOGY
- Polynomial closure of group languages and open sets of the Hall topology
- On a locality-like property of the pseudovariety J
- APERIODIC POINTLIKES AND BEYOND
- On the hyperdecidability of semidirect products of pseudovarieties
- A profinite approach to stable pairs.
- COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
- On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties.
- Reducibility of pointlike problems
- An upper bound for the power pseudovariety \(\mathbf{PCS}\).
- Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples
- Tameness of joins involving the pseudovariety of local semilattices.
- TAMENESS OF THE PSEUDOVARIETY LS1
- COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY
- Abelian kernels, profinite topologies and the extension problem
- Möbius functions and semigroup representation theory. II: Character formulas and multiplicities.
- The \(\mathbf G\)-exponent of a pseudovariety of semigroups
- ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS
- About the power pseudovariety \(\mathbf{PCS}\)
- On non-commuting sets in finite soluble CC-groups.
- Reducibility vs. definability for pseudovarieties of semigroups
- Pointlike reducibility of pseudovarieties of the form \(\mathbf V*\mathbf D\).
- On the power pseudovariety \(\mathbf{PCS}\).
- On All Things Star-Free
- Monoid kernels and profinite topologies on the free Abelian group
- The finite basis problem in the pseudovariety joins of aperiodic semigroups with groups
- A syntactic approach to covers for E ‐dense semigroups over group varieties
- The pseudoidentity problem and reducibility for completely regular semigroups
- Inverse automata and profinite topologies on a free group
- A NEW PROOF OF THE RHODES TYPE II CONJECTURE
- Completely regular semigroup varieties generated by Mal'cev products with groups
- On Pointlike Sets and Joins of Pseudovarieties
- The pseudovariety of all nilpotent groups is tame
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- Some reducibility properties for pseudovarieties of the form \(DRH\)
- Dynamics of implicit operations and tameness of pseudovarieties of groups
- Finite loops recognize exactly the regular open languages
- Pointlike sets with respect to R and J.
- An application of a theorem of Ash to finite covers.
- SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS
- Polynomial closure of group languages and open sets of the Hall topology
- Reducibility of Joins Involving Some Locally Trivial Pseudovarieties
- First-order separation over countable ordinals
- Pointlike sets for varieties determined by groups
- Relative Abelian kernels of some classes of transformation monoids
- On discrete hyperbolic arboreal groups
- A constructive version of the Ribes-Zalesskiĭ product theorem.
- CATEGORIES AS ALGEBRA, II
- Closures of regular languages for profinite topologies.
- Krohn-Rhodes complexity pseudovarieties are not finitely based
- On \(F\)-inverse covers of finite-above inverse monoids.
- Polynomial closure and unambiguous product
- On Radical Congruence Systems II
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
- WHAT ARE MODULES? AN OVERVIEW OF BRET TILSON'S PAPER "MODULES" FROM A GEOMETRIC VIEWPOINT
- COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY
- Recognizing pro-\(\mathrm{R}\) closures of regular languages
- New results on the conjecture of Rhodes and on the topological conjecture
- Constructing divisions into power groups
- PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
- The pseudovariety $J$ is hyperdecidable
- Profinite topologies
- POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS
- Commutative images of rational languages and the Abelian kernel of a monoid
- Finite state automata: a geometric approach
- An effective lower bound for group complexity of finite semigroups and automata
- Conelikes and ranker comparisons
- SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS
- IDEMPOTENT POINTLIKE SETS
- STABLE PAIRS
- TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
- On \(F\)-inverse covers of inverse monoids.
- Semidirect product with an order-computable pseudovariety and tameness.
- Tameness of pseudovariety joins involving R.
- Computing relative Abelian kernels of finite monoids.
- SC-hyperdecidability of \(\mathbf R\)
- Characterizing level one in group-based concatenation hierarchies
This page was built for publication: INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3209328)
