Abstract. We give new examples of FA presentable torsion-free abelian groups. Namely, for every n � 2, we construct a rank n indecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group (Z, +) 2 in which every nontrivial cyclic subgroup is not FA recognizable.
The class of almost completely decomposable groups with a critical typeset of type (2, 2) and a regu...
We study finitely generated groups whose word problems are accepted by counter automata. We show tha...
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct...
We consider structures which are FA-presentable. It is known that an FA-presentable finitely generat...
AbstractWe consider structures which are FA-presentable. It is known that an FA-presentable finitely...
A finite automaton is one of the classic models of recognition devices, which is used to determine t...
A finite automaton is one of the classic models of recognition devices, which is used to determine t...
AbstractSome results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theore...
AbstractIn an earlier paper the authors introduced a K0-like construction that produces, for each to...
This paper studies FA-presentable structures and gives a complete classification of the finitely gen...
AbstractThis paper applies the concept of FA-presentable structures to semigroups. We give a complet...
Abstract. In this paper we study obstructions to presentability by prod-ucts for finitely generated ...
This paper applies the concept of FA-presentable structures to semigroups. We give a complete classi...
In this paper we study obstructions to presentability by products for finitely generated groups. Alo...
The search for complete sets of invaxiants is a recurrent theme in the theory of abeliaR groups. Thi...
The class of almost completely decomposable groups with a critical typeset of type (2, 2) and a regu...
We study finitely generated groups whose word problems are accepted by counter automata. We show tha...
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct...
We consider structures which are FA-presentable. It is known that an FA-presentable finitely generat...
AbstractWe consider structures which are FA-presentable. It is known that an FA-presentable finitely...
A finite automaton is one of the classic models of recognition devices, which is used to determine t...
A finite automaton is one of the classic models of recognition devices, which is used to determine t...
AbstractSome results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theore...
AbstractIn an earlier paper the authors introduced a K0-like construction that produces, for each to...
This paper studies FA-presentable structures and gives a complete classification of the finitely gen...
AbstractThis paper applies the concept of FA-presentable structures to semigroups. We give a complet...
Abstract. In this paper we study obstructions to presentability by prod-ucts for finitely generated ...
This paper applies the concept of FA-presentable structures to semigroups. We give a complete classi...
In this paper we study obstructions to presentability by products for finitely generated groups. Alo...
The search for complete sets of invaxiants is a recurrent theme in the theory of abeliaR groups. Thi...
The class of almost completely decomposable groups with a critical typeset of type (2, 2) and a regu...
We study finitely generated groups whose word problems are accepted by counter automata. We show tha...
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct...