rational subset
Recently Published Documents


TOTAL DOCUMENTS

10
(FIVE YEARS 0)

H-INDEX

6
(FIVE YEARS 0)

2010 ◽  
Vol 20 (04) ◽  
pp. 561-590 ◽  
Author(s):  
PEDRO V. SILVA ◽  
PASCAL WEIL

We show that the following problems are decidable in a rank 2 free group F2: Does a given finitely generated subgroup H contain primitive elements? And does H meet the orbit of a given word u under the action of G, the group of automorphisms of F2? Moreover, decidability subsists if we allow H to be a rational subset of F2, or alternatively if we restrict G to be a rational subset of the set of invertible substitutions (a.k.a. positive automorphisms). In higher rank, the following weaker problem is decidable: given a finitely generated subgroup H, a word u and an integer k, does H contain the image of u by some k-almost bounded automorphism? An automorphism is k-almost bounded if at most one of the letters has an image of length greater than k.


2008 ◽  
Vol 320 (2) ◽  
pp. 728-755 ◽  
Author(s):  
Markus Lohrey ◽  
Benjamin Steinberg

2008 ◽  
Vol 18 (01) ◽  
pp. 181-208 ◽  
Author(s):  
VOLKER DIEKERT ◽  
NICOLE ONDRUSCH ◽  
MARKUS LOHREY

Let G be a finitely generated virtually-free group. We consider the Birget–Rhodes expansion of G, which yields an inverse monoid and which is denoted by IM (G) in the following. We show that for a finite idempotent presentation P, the word problem of a quotient monoid IM (G)/P can be solved in linear time on a RAM. The uniform word problem, where G and the presentation P are also part of the input, is EXPTIME-complete. With IM (G)/P we associate a relational structure, which contains for every rational subset L of IM (G)/P a binary relation, consisting of all pairs (x,y) such that y can be obtained from x by right multiplication with an element from L. We prove that the first-order theory of this structure is decidable. This result implies that the emptiness problem for Boolean combinations of rational subsets of IM (G)/P is decidable, which, in turn implies the decidability of the submonoid membership problem of IM (G)/P. These results were known previously for free groups, only. Moreover, we provide a new algorithmic approach for these problems, which seems to be of independent interest even for free groups. We also show that one cannot expect decidability results in much larger frameworks than virtually-free groups because the subgroup membership problem of a subgroup H in an arbitrary group G can be reduced to a word problem of some IM (G)/P, where P depends only on H. A consequence is that there is a hyperbolic group G and a finite idempotent presentation P such that the word problem is undecidable for some finitely generated submonoid of IM (G)/P. In particular, the word problem of IM (G)/P is undecidable.


2007 ◽  
Vol 309 (2) ◽  
pp. 622-639 ◽  
Author(s):  
Mark Kambites ◽  
Pedro V. Silva ◽  
Benjamin Steinberg
Keyword(s):  

2006 ◽  
Vol 17 (03) ◽  
pp. 493-506 ◽  
Author(s):  
SERGEY AFONIN ◽  
ELENA KHAZOVA

Let Σ be a finite alphabet. A set [Formula: see text] of regular languages over Σ is called rational if there exists a finite set [Formula: see text] of regular languages over Σ such that [Formula: see text] is a rational subset of the finitely generated semigroup [Formula: see text] with [Formula: see text] as the set of generators and language concatenation as a product. We prove that for any rational set [Formula: see text] and any regular language R ⊆ Σ* it is decidable (1) whether [Formula: see text] or not, and (2) whether [Formula: see text] is finite or not. Possible applications to semistructured databases query processing are discussed.


1999 ◽  
Vol 60 (3) ◽  
pp. 391-402 ◽  
Author(s):  
Benjamin Steinberg

To each pseudovariety of Abelian groups residually containing the integers, there is naturally associated a profinite topology on any finite rank free Abelian group. We show in this paper that if the pseudovariety in question has a decidable membership problem, then one can effectively compute membership in the closure of a subgroup and, more generally, in the closure of a rational subset of such a free Abelian group. Several applications to monoid kernels and finite monoid theory are discussed.


1993 ◽  
Vol 03 (01) ◽  
pp. 79-99 ◽  
Author(s):  
STUART W. MARGOLIS ◽  
JOHN C. MEAKIN

The relationship between covering spaces of graphs and subgroups of the free group leads to a rapid proof of the Nielsen-Schreier subgroup theorem. We show here that a similar relationship holds between immersions of graphs and closed inverse submonoids of free inverse monoids. We prove using these methods, that a closed inverse submonoid of a free inverse monoid is finitely generated if and only if it has finite index if and only if it is a rational subset of the free inverse monoid in the sense of formal language theory. We solve the word problem for the free inverse category over a graph Γ. We show that immersions over Γ may be classified via conjugacy classes of loop monoids of the free inverse category over Γ. In the case that Γ is a bouquet of X circles, we prove that the category of (connected) immersions over Γ is equivalent to the category of (transitive) representations of the free inverse monoid FIM(X). Such representations are coded by closed inverse submonoids of FIM(X). These monoids will be constructed in a natural way from groups acting freely on trees and they admit an idempotent pure retract onto a free inverse monoid. Applications to the classification of finitely generated subgroups of free groups via finite inverse monoids are developed.


1991 ◽  
Vol 01 (04) ◽  
pp. 411-436 ◽  
Author(s):  
KARSTEN HENCKELL ◽  
STUART W. MARGOLIS ◽  
JEAN-ERIC PIN ◽  
JOHN RHODES

This paper is concerned with the many deep and far reaching consequences of Ash's positive solution of the type II conjecture for finite monoids. After reviewing the statement and history of the problem, we show how it can be used to decide if a finite monoid is in the variety generated by the Malcev product of a given variety and the variety of groups. Many interesting varieties of finite monoids have such a description including the variety generated by inverse monoids, orthodox monoids and solid monoids. A fascinating case is that of block groups. A block group is a monoid such that every element has at most one semigroup inverse. As a consequence of the cover conjecture — also verified by Ash — it follows that block groups are precisely the divisors of power monoids of finite groups. The proof of this last fact uses earlier results of the authors and the deepest tools and results from global semigroup theory. We next give connections with the profinite group topologies on finitely generated free monoids and free groups. In particular, we show that the type II conjecture is equivalent with two other conjectures on the structure of closed sets (one conjecture for the free monoid and another one for the free group). Now Ash's theorem implies that the two topological conjectures are true and independently, a direct proof of the topological conjecture for the free group has been recently obtained by Ribes and Zalesskii. An important consequence is that a rational subset of a finitely generated free group G is closed in the profinite topology if and only if it is a finite union of sets of the form gH1H2…Hn, where g ∈ G and each Hi is a finitely generated subgroup of G. This significantly extends classical results of M. Hall. Finally, we return to the roots of this problem and give connections with the complexity theory of finite semigroups. We show that the largest local complexity function in the sense of Rhodes and Tilson is computable.


Sign in / Sign up

Export Citation Format

Share Document