Finitely generated subgroups of free groups as formal languages and their cogrowth

2021 ◽  
Vol volume 13, issue 2 ◽  
Author(s):  
Arman Darbinyan ◽  
Rostislav Grigorchuk ◽  
Asif Shaikh
Keyword(s):  
Free Group ◽  
Finite Automaton ◽  
Finite Rank ◽  
Regular Language ◽  
Free Groups ◽  
Formal Languages ◽  
Finitely Generated ◽  
Deterministic Finite Automaton ◽  
Method Of Calculation ◽  
Reduced Words

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the minimal deterministic finite automaton that recognizes $L_H$. Then we characterize the f.g. subgroups $H$ for which $L_H$ is irreducible and for such groups explicitly construct ergodic automaton that recognizes $L_H$. This construction gives us an efficient way to compute the cogrowth series $L_H(z)$ of $H$ and entropy of $L_H$. Several examples illustrate the method and a comparison is made with the method of calculation of $L_H(z)$ based on the use of Nielsen system of generators of $H$.

scholarly journals Finitely generated subgroups of free groups as formal languages and their cogrowth

2021 ◽  
Vol volume 13, issue 2 ◽  
Author(s):  
Arman Darbinyan ◽  
Rostislav Grigorchuk ◽  
Asif Shaikh
Keyword(s):  
Free Group ◽  
Finite Automaton ◽  
Finite Rank ◽  
Regular Language ◽  
Free Groups ◽  
Formal Languages ◽  
Finitely Generated ◽  
Deterministic Finite Automaton ◽  
Method Of Calculation ◽  
Reduced Words

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the minimal deterministic finite automaton that recognizes $L_H$. Then we characterize the f.g. subgroups $H$ for which $L_H$ is irreducible and for such groups explicitly construct ergodic automaton that recognizes $L_H$. This construction gives us an efficient way to compute the cogrowth series $L_H(z)$ of $H$ and entropy of $L_H$. Several examples illustrate the method and a comparison is made with the method of calculation of $L_H(z)$ based on the use of Nielsen system of generators of $H$.

scholarly journals Solution sets for equations over free groups are EDT0L languages

2016 ◽  
Vol 26 (05) ◽  
pp. 843-886 ◽  
Author(s):  
Laura Ciobanu ◽  
Volker Diekert ◽  
Murray Elder
Keyword(s):  
Directed Graph ◽  
Free Group ◽  
Diophantine Equations ◽  
Free Groups ◽  
Explicit Construction ◽  
Finitely Generated ◽  
Solution Sets ◽  
Linear Diophantine Equations ◽  
All Solutions ◽  
Reduced Words

We show that, given an equation over a finitely generated free group, the set of all solutions in reduced words forms an effectively constructible EDT0L language. In particular, the set of all solutions in reduced words is an indexed language in the sense of Aho. The language characterization we give, as well as further questions about the existence or finiteness of solutions, follow from our explicit construction of a finite directed graph which encodes all the solutions. Our result incorporates the recently invented recompression technique of Jeż, and a new way to integrate solutions of linear Diophantine equations into the process. As a byproduct of our techniques, we improve the complexity from quadratic nondeterministic space in previous works to [Formula: see text] here.

scholarly journals STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS

2007 ◽  
Vol 17 (08) ◽  
pp. 1493-1535 ◽  
Author(s):  
L. MARKUS-EPSTEIN
Keyword(s):  
Free Group ◽  
Finite Groups ◽  
Finite Automaton ◽  
Finite Automata ◽  
Free Groups ◽  
Minimal Immersion ◽  
Finitely Generated ◽  
Inverse Monoids ◽  
Folding Algorithm ◽  
Algorithmic Problems

Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse automaton. This allows for the deep algorithmic theory of finite automata and finite inverse monoids to be used to answer questions about finitely generated subgroups of free groups. In this paper, we attempt to apply the same methods to other classes of groups. A fundamental new problem is that the Stallings folding algorithm must be modified to allow for "sewing" on relations of non-free groups. We look at the class of groups that are amalgams of finite groups. It is known that these groups are locally quasiconvex and thus, all finitely generated subgroups are represented by finite automata. We present an algorithm to compute such a finite automaton and use it to solve various algorithmic problems.

scholarly journals Folding-like techniques for CAT(0) cube complexes

2021 ◽  
pp. 1-12
Author(s):  
MICHAEL BEN–ZVI ◽  
ROBERT KROPHOLLER ◽  
RYLEE ALANZA LYMAN
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Coxeter Groups ◽  
Free Groups ◽  
Fundamental Groups ◽  
Finitely Generated ◽  
Seminal Paper ◽  
Finite Graphs ◽  
Cube Complexes ◽  
Positively Curved

Abstract In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings’s methods allow one to construct this representation algorithmically, giving effective, algorithmic answers and proofs to classical questions about subgroups of free groups. Recently Dani–Levcovitz used Stallings-like methods to study subgroups of right-angled Coxeter groups, which act geometrically on CAT(0) cube complexes. In this paper we extend their techniques to fundamental groups of non-positively curved cube complexes.

Basics

2018 ◽  
pp. 7-8
Author(s):  
Christophe Reutenauer
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Free Monoid ◽  
Periodic Pattern ◽  
Infinite Words ◽  
Reduced Words

Definitions and basic results about words: alphabet, length, free monoid, concatenation, prefix, suffix, factor, conjugation, reversal, palindrome, commutative image, periodicity, ultimate periodicity, periodic pattern, infinite words, bi-infinite words, free groups, reduced words, homomorphisms, embedding of a free monoid in a free group, abelianization,matrix of an endomorphism, GL2(Z), SL2(Z).

scholarly journals A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS

2006 ◽  
Vol 16 (06) ◽  
pp. 1031-1045 ◽  
Author(s):  
NICHOLAS W. M. TOUIKAN
Keyword(s):  
Free Group ◽  
Fast Algorithm ◽  
Free Groups ◽  
Membership Problem ◽  
Finitely Generated ◽  
Folding Process ◽  
Algorithmic Problems ◽  
The Given

Stalling's folding process is a key algorithm for solving algorithmic problems for finitely generated subgroups of free groups. Given a subgroup H = 〈J1,…,Jm〉 of a finitely generated nonabelian free group F = F(x1,…,xn) the folding porcess enables one, for example, to solve the membership problem or compute the index [F : H]. We show that for a fixed free group F and an arbitrary finitely generated subgroup H (as given above) we can perform the Stallings' folding process in time O(N log *(N)), where N is the sum of the word lengths of the given generators of H.

scholarly journals State Complexity of Suffix Distance

2019 ◽  
Vol 30 (06n07) ◽  
pp. 1197-1216
Author(s):  
Timothy Ng ◽  
David Rappaport ◽  
Kai Salomaa
Keyword(s):  
Lower Bound ◽  
Finite Automaton ◽  
Regular Language ◽  
Upper Bounds ◽  
The State ◽  
Deterministic Finite Automaton ◽  
Tight Bound ◽  
State Complexity

The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of the neighbourhood of radius [Formula: see text] of an [Formula: see text]-state deterministic finite automaton language with respect to the suffix distance and the subword distance, respectively. For restricted values of [Formula: see text] and [Formula: see text] we give a matching lower bound for the state complexity of suffix distance neighbourhoods.

scholarly journals Finitely generated cyclic extensions of free groups are residually finite

1971 ◽  
Vol 5 (1) ◽  
pp. 87-94 ◽  
Author(s):  
Gilbert Baumslag
Keyword(s):  
Free Group ◽  
Principal Ideal ◽  
Free Groups ◽  
Cyclic Extension ◽  
Principal Ideal Domain ◽  
Finitely Generated ◽  
Finitely Generated Module ◽  
Residually Finite ◽  
Ideal Domain ◽  
Direct Sum

We establish the result that a finitely generated cyclic extension of a free group is residually finite. This is done, in part, by making use of the fact that a finitely generated module over a principal ideal domain is a direct sum of cyclic modules.

scholarly journals ON RESTRICTING SUBSETS OF BASES IN RELATIVELY FREE GROUPS

2012 ◽  
Vol 22 (04) ◽  
pp. 1250030
Author(s):  
LUCAS SABALKA ◽  
DMYTRO SAVCHUK
Keyword(s):  
Solvable Group ◽  
Free Group ◽  
Free Groups ◽  
Finitely Generated ◽  
Free Solvable Group ◽  
Relatively Free Group

Let G be a finitely generated free, free abelian of arbitrary exponent, free nilpotent, or free solvable group, or a free group in the variety AmAn, and let A = {a1,…, ar} be a basis for G. We prove that, in most cases, if S is a subset of a basis for G which may be expressed as a word in A without using elements from {al+1,…, ar} for some l < r, then S is a subset of a basis for the relatively free group on {a1,…, al}.

scholarly journals On the generic type of the free group

2011 ◽  
Vol 76 (1) ◽  
pp. 227-234 ◽  
Author(s):  
Rizos Sklinos
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Free Groups ◽  
Primitive Elements ◽  
Generic Type

AbstractWe answer a question raised in [9], that is whether the infinite weight of the generic type of the free group is witnessed in Fω. We also prove that the set of primitive elements in finite rank free groups is not uniformly definable. As a corollary, we observe that the generic type over the empty set is not isolated. Finally, we show that uncountable free groups are not ℵ1-homogeneous.

Sign in / Sign up

Export Citation Format

Share Document