Pages that link to "Item:Q3110897"
From MaRDI portal
The following pages link to BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS (Q3110897):
Displayed 11 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Automatic models of first order theories (Q387121) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- Word automatic groups of nilpotency class 2 (Q6072210) (← links)
- On interpretations of Presburger arithmetic in Büchi arithmetics (Q6095191) (← links)