CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
From MaRDI portal
Publication:4786288
DOI10.1142/S0218196701000498zbMath1027.20036MaRDI QIDQ4786288
Stuart W. Margolis, Pascal Weil, Mark V. Sapir
Publication date: 15 December 2002
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
inverse monoids; free groups; membership problem; extension problem; pseudovarieties of finite groups; Mal'cev products; inverse automata; pro-\(p\) closures; pro-nilpotent closures
20M07: Varieties and pseudovarieties of semigroups
20M05: Free semigroups, generators and relations, word problems
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
20E18: Limits, profinite groups
Related Items
The geometry of profinite graphs with applications to free groups and finite monoids, A NEW PROOF OF THE RHODES TYPE II CONJECTURE, PROFINITE TOPOLOGIES IN FREE PRODUCTS OF GROUPS, PROFINITE METHODS IN SEMIGROUP THEORY, COMBINATORIAL GROUP THEORY, INVERSE MONOIDS, AUTOMATA, AND GLOBAL SEMIGROUP THEORY, Statistical properties of subgroups of free groups, Inverse automata and profinite topologies on a free group, Computing fixed closures in free groups., The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups, A constructive version of the Ribes-Zalesskiĭ product theorem., Varieties of finite supersolvable groups with the M.~Hall property., Finite state automata: A geometric approach, A Lower Bound For Reversible Automata, Dynamics of implicit operations and tameness of pseudovarieties of groups, Fixed Subgroups are Compressed in Free Groups, STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS, On an algorithm to decide whether a free group is a free factor of another, RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP, READING OFF KUROSH DECOMPOSITIONS
Cites Work
- Topology of finite graphs
- Topologies for the free monoid
- Profinite semigroups, Mal'cev products, and identities
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- On The Profinite Topology on a Free Group
- THE PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY