FINITE AUTOMATA OVER FREE GROUPS

2000 ◽  
Vol 10 (06) ◽  
pp. 725-737 ◽  
Author(s):  
JÜRGEN DASSOW ◽  
VICTOR MITRANA
Keyword(s):  
Free Group ◽  
Finite Automata ◽  
Free Groups ◽  
Input String ◽  
Neutral Element ◽  
Deterministic Case ◽  
Final Configuration ◽  
Context Free

Finite automata are extended by adding an element of a given group to each of their configurations. An input string is accepted if and only if the neutral element of the group is associated to a final configuration reached by the automaton. We get a new characterization of the context-free languages as soon as the considered group is the binary free group. The result cannot be carried out in the deterministic case. Some remarks about finite automata over other groups are also presented.

scholarly journals Reversible parallel communicating finite automata systems

2021 ◽  
Vol 58 (4) ◽  
pp. 263-279
Author(s):  
Henning Bordihn ◽  
György Vaszil
Keyword(s):  
Finite Automata ◽  
Regular Languages ◽  
The Other ◽  
Deterministic Case ◽  
Computational Power ◽  
Deterministic Finite Automata ◽  
Relationship Of ◽  
The Relationship ◽  
Context Free

AbstractWe study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.

scholarly journals On finitely generated submonoids of virtually free groups

2018 ◽  
Vol 10 (2) ◽  
pp. 63-82
Author(s):  
Pedro V. Silva ◽  
Alexander Zakharov
Keyword(s):  
Word Problem ◽  
Free Group ◽  
Free Groups ◽  
Isomorphism Problem ◽  
Geometric Characterization ◽  
Finitely Generated ◽  
Free Monoids ◽  
Virtually Free Group

AbstractWe prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization of graded submonoids in virtually free groups as quasi-geodesic submonoids, and show that their word problem is rational (as a relation). We also solve the isomorphism problem for this class of monoids, generalizing earlier results for submonoids of free monoids. We also prove that the classes of graded monoids, regular monoids and Kleene monoids coincide for submonoids of free groups.

∀-free metabelian groups

1997 ◽  
Vol 62 (1) ◽  
pp. 159-174 ◽  
Author(s):  
Olivier Chapuis
Keyword(s):  
Free Group ◽  
Metabelian Group ◽  
Free Groups ◽  
Nilpotent Groups ◽  
Explicit Description ◽  
Universal Theory ◽  
Metabelian Groups ◽  
Free Metabelian Group ◽  
Finitely Generated Groups

In 1965, during the first All-Union Symposium on Group Theory, Kargapolov presented the following two problems: (a) describe the universal theory of free nilpotent groups of class m; (b) describe the universal theory of free groups (see [18, 1.28 and 1.27]). The first of these problems is still open and it is known [25] that a positive solution of this problem for an m ≤ 2 should imply the decidability of the universal theory of the field of the rationals (this last problem is equivalent to Hilbert's tenth problem for the field of the rationals which is a difficult open problem; see [17] and [20] for discussions on this problem). Regarding the second problem, Makanin proved in 1985 that a free group has a decidable universal theory (see [15] for stronger results), however, the problem of deriving an explicit description of the universal theory of free groups is open. To try to solve this problem Remeslennikov gave different characterization of finitely generated groups with the same universal theory as a noncyclic free group (see [21] and [22] and also [11]). Recently, the author proved in [8] that a free metabelian group has a decidable universal theory, but the proof of [8] does not give an explicit description of the universal theory of free metabelian groups.

scholarly journals AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK

2011 ◽  
Vol 21 (01n02) ◽  
pp. 329-354 ◽  
Author(s):  
BENJAMIN STEINBERG ◽  
MARIYA VOROBETS ◽  
YAROSLAV VOROBETS
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Finite Automata ◽  
Free Groups ◽  
Free Products ◽  
Cyclic Groups ◽  
Binary Alphabet

We construct automata over a binary alphabet with 2n states, n ≥ 2, whose states freely generate a free group of rank 2n. Combined with previous work, this shows that a free group of every finite rank can be generated by finite automata over a binary alphabet. We also construct free products of cyclic groups of order two via such automata.

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.

EXTENDED FINITE AUTOMATA AND WORD PROBLEMS

2005 ◽  
Vol 15 (03) ◽  
pp. 455-466 ◽  
Author(s):  
JON M. CORSON
Keyword(s):  
Word Problem ◽  
Free Group ◽  
Finite Index ◽  
Finite Automata ◽  
Free Subgroup ◽  
Complete Proof ◽  
Finitely Generated Groups ◽  
The Family ◽  
Critical Error ◽  
Context Free

This paper considers extended finite automata over monoids, in the sense of Dassow and Mitrana. We show that the family of languages accepted by extended finite automata over a monoid K is controlled by the word problem of K in a precisely stated manner. We also point out a critical error in the proof of the main result in the paper by Dassow and Mitrana. However as one consequence of our approach, by analyzing a certain word problem, we obtain a complete proof of this result, namely that the family of languages accepted by extended finite automata over the free group of rank two is exactly the family of context-free languages. We further deduce that along with the free group of rank two, the only finitely generated groups with this property are precisely the groups that have a nonabelian free subgroup of finite index.

scholarly journals FULLY RESIDUALLY FREE GROUPS AND GRAPHS LABELED BY INFINITE WORDS

2006 ◽  
Vol 16 (04) ◽  
pp. 689-737 ◽  
Author(s):  
ALEXEI G. MYASNIKOV ◽  
VLADIMIR N. REMESLENNIKOV ◽  
DENIS E. SERBIN
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Membership Problem ◽  
Finitely Generated ◽  
Limit Groups ◽  
Infinite Words ◽  
Integer Coefficients ◽  
Ring Of Polynomials

Let F = F(X) be a free group with basis X and ℤ[t] be a ring of polynomials with integer coefficients in t. In this paper we develop a theory of (ℤ[t],X)-graphs — a powerful tool in studying finitely generated fully residually free (limit) groups. This theory is based on the Kharlampovich–Myasnikov characterization of finitely generated fully residually free groups as subgroups of the Lyndon's group Fℤ[t], the author's representation of elements of Fℤ[t] by infinite (ℤ[t],X)-words, and Stallings folding method for subgroups of free groups. As an application, we solve the membership problem for finitely generated subgroups of Fℤ[t], as well as for finitely generated fully residually free groups.

Subgroups of Finite Index in Free Groups

1949 ◽  
Vol 1 (2) ◽  
pp. 187-190 ◽  
Author(s):  
Marshall Hall
Keyword(s):  
Free Group ◽  
Finite Index ◽  
Free Groups ◽  
Recursion Formula ◽  
Independent Interest ◽  
Finiteness Conditions ◽  
Total Length ◽  
Free Generators

This paper has as its chief aim the establishment of two formulae associated with subgroups of finite index in free groups. The first of these (Theorem 3.1) gives an expression for the total length of the free generators of a subgroup U of the free group Fr with r generators. The second (Theorem 5.2) gives a recursion formula for calculating the number of distinct subgroups of index n in Fr.Of some independent interest are two theorems used which do not involve any finiteness conditions. These are concerned with ways of determining a subgroup U of F.

scholarly journals A dendrological proof of the Scott conjecture for automorphisms of free groups

1998 ◽  
Vol 41 (2) ◽  
pp. 325-332 ◽  
Author(s):  
D. Gaboriau ◽  
G. Levitt ◽  
M. Lustig
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Alternative Proof ◽  
Automorphisms Of Free Groups

Let α be an automorphism of a free group of rank n. The Scott conjecture, proved by Bestvina-Handel, asserts that the fixed subgroup of α has rank at most n. We give a short alternative proof of this result using R-trees.

scholarly journals On a Nonsingular Equation of Length 9 Over Torsion Free Groups

2019 ◽  
Vol 12 (2) ◽  
pp. 590-604
Author(s):  
M. Fazeel Anwar ◽  
Mairaj Bibi ◽  
Muhammad Saeed Akram
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Torsion Free Group ◽  
Torsion Free

In \cite{levin}, Levin conjectured that every equation is solvable over a torsion free group. In this paper we consider a nonsingular equation $g_{1}tg_{2}t g_{3}t g_{4} t g_{5} t g_{6} t^{-1} g_{7} t g_{8}t \\ g_{9}t^{-1} = 1$ of length $9$ and show that it is solvable over torsion free groups modulo some exceptional cases.

Sign in / Sign up

Export Citation Format

Share Document