A NEW PROOF OF THE RHODES TYPE II CONJECTURE

DOI10.1142/S0218196704001918zbMath1074.20037WikidataQ123359030 ScholiaQ123359030MaRDI QIDQ4658701

Karl Auinger

Publication date: 18 March 2005

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

zbMATH Keywords

inevitable graphsRhodes type II conjecture

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18)

Related Items (3)

Closures of regular languages for profinite topologies. ⋮ An effective lower bound for group complexity of finite semigroups and automata ⋮ A constructive version of the Ribes-Zalesskiĭ product theorem.

Cites Work

• Unnamed Item
• Topology of finite graphs
• E-unitary inverse monoids and the Cayley graph of a group presentation
• Semigroup expansions using the derived category, kernel, and Malcev products
• Stallings foldings and subgroups of free groups
• Improved lower bounds for the complexity of finite semigroups
• Finite state automata: A geometric approach
• Dynamics of implicit operations and tameness of pseudovarieties of groups
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• A Conjecture on the Hall Topology for the Free Group
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• On The Profinite Topology on a Free Group
• The geometry of profinite graphs with applications to free groups and finite monoids
• A syntactic approach to covers for E ‐dense semigroups over group varieties
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
• Inverse automata and profinite topologies on a free group

This page was built for publication: A NEW PROOF OF THE RHODES TYPE II CONJECTURE