… FA presentable abelian groups … FA presentable groups or monoids is itself FA presentable.
We then use this method to give new examples of FA presentable torsion-free abelian groups…

… More generally, any torsion-free abelian group that is divisible by infinitely … -presentable
abelian group G is an extension of a finite rank free group by a finite direct sum of Prüfer groups Z…

… and the group operation can be recognized by finite automata (… obtain new FA-presentable
abelian groups from given ones. … FA-presentable abelian group, and let A be a abelian group …

… domain and relations can be checked by finite automata as opposed to Turing machines; we
… an abelian subgroup A of finite index in H. We may assume that A is a free abelian group Zr …

… We give new examples of FA presentable torsion-free abelian groups. Namely, for every …
abelian group which has an FA presentation. We also construct an FA presentation of the group …

… We restrict ourselves to a finite automa presentable subclass, … these modules are finitely
generated abelian groups, the class of … We begin by recalling the definition of finite automata. …

… Finite automata are a robust model of computation that seem … classes of structures presentable
by -automata and ( )-tree automata. My … (vi) Every finitely generated Abelian group (G;+) is …

… generated commutative semigroups are FA-presentable. We … recognizable by synchronous
finite automata; see Definition … abelian group is the direct sum of finitely many cyclic groups, …

… (and more generally for possibly non-commutative rings with identity and no zero divisors)
[… Let 3 be a deterministic complete finite automaton recognizing L. Suppose 3 has state set Q, …

… groups, called infinitely independently presentable groups, … to infer that a group is infinitely
independently presentable. In … of an (abelian) minimax group: an abelian group is called …