Finite automata presentable Abelian groups

DOI10.1016/j.apal.2009.07.006zbMath1219.68116OpenAlexW4212972664MaRDI QIDQ636284

Pavel Semukhin, André Nies

Publication date: 26 August 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2009.07.006

zbMATH Keywords

automatic structurestorsion-free abelian groups

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Torsion-free groups, finite rank (20K15)

Related Items (9)

Tree-automatic scattered linear orders ⋮ Automatic learners with feedback queries ⋮ Automatic models of first order theories ⋮ Word automatic groups of nilpotency class 2 ⋮ String compression in FA-presentable structures ⋮ Semiautomatic structures ⋮ Subalgebras of FA-presentable algebras. ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Cayley polynomial-time computable groups

Cites Work

• FA-presentable groups and rings
• Powers of rationals modulo 1 and rational base number systems
• Finite rank torsion free Abelian groups and rings
• Describing Groups
• Summands of Separable Abelian Groups: Dedicated to Paul Turán on his 60th Birthday
• STACS 2005
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite automata presentable Abelian groups