BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS

DOI10.1142/S0218196711006625zbMath1245.20067OpenAlexW2063424173MaRDI QIDQ3110897

Gábor Braun, Lutz H. Strüngmann

Publication date: 16 January 2012

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196711006625

zbMATH Keywords

torsion-free Abelian groupsadditive combinatoricsautomatic structuresFA-presentable 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

Tree-automatic scattered linear orders ⋮ Automatic models of first order theories ⋮ Word automatic groups of nilpotency class 2 ⋮ On interpretations of Presburger arithmetic in Büchi arithmetics ⋮ Isomorphisms of scattered automatic linear orders ⋮ Algebraic structures computable without delay ⋮ Eliminating unbounded search in computable algebra ⋮ The back-and-forth method and computability without delay ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Where Automatic Structures Benefit from Weighted Automata ⋮ The isomorphism problem on classes of automatic structures with transitive relations

Cites Work

• FA-presentable groups and rings
• On direct products of automaton decidable theories
• Finite Automata Presentable Abelian Groups

This page was built for publication: BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS