Finite Automata Presentable Abelian Groups

Authors:
André Nies;Pavel Semukhin
Affiliations:
Department of Computer Science, University of Auckland, New Zealand;Department of Computer Science, University of Auckland, New Zealand
Venue:
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Year:
2007

Citing 4
Cited 0

Automatic Presentations of Structures

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Automatic Structures

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic structures: overview and future directions

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Automatic Structures: Richness and Limitations

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give new examples of FA presentable torsion-free abelian groups. Namely, for every n 驴 2, we construct a rank nindecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group (驴, + )2in which every nontrivial cyclic subgroup is not FA recognizable.