The following pages link to Describing Groups (Q3533517):
Displaying 34 items.
- Automatic models of first order theories (Q387121) (← links)
- Finite automata presentable Abelian groups (Q636284) (← links)
- The isomorphism relation between tree-automatic structures (Q707994) (← links)
- FA-presentable groups and rings (Q947484) (← links)
- Automatic presentations for semigroups. (Q1041033) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- Semiautomatic structures (Q1694004) (← links)
- Bi-interpretability of some monoids with the arithmetic and applications (Q2003186) (← links)
- Finitely generated groups are universal among finitely generated structures (Q2003917) (← links)
- Complete first-order theories of some classical matrix groups over algebraic integers (Q2029249) (← links)
- Lamplighter groups and automata (Q2170284) (← links)
- A topological zero-one law and elementary equivalence of finitely generated groups (Q2220487) (← links)
- Model-theoretic properties of \(\omega\)-automatic structures (Q2254518) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- Randomness of formal languages via automatic martingales (Q2420647) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- Automatic learners with feedback queries (Q2637649) (← links)
- Bi-interpretability and QFA structures: study of some soluble groups and commutative rings. (Bi-interprétabilité et structures QFA : étude de groupes résolubles et des anneaux commutatifs (Q2643485) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- Defining Multiplication in Some Additive Expansions of Polynomial Rings (Q2813650) (← links)
- Learning Pattern Languages over Groups (Q2830276) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- R.J. THOMPSON’S GROUPS<i>F</i>AND<i>T</i>ARE BI-INTERPRETABLE WITH THE RING OF THE INTEGERS (Q2933670) (← links)
- LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC (Q2940868) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← links)
- Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle (Q3183193) (← links)
- Finitely Generated Semiautomatic Groups (Q3188266) (← links)
- Automatic Presentations for Cancellative Semigroups (Q3540105) (← links)
- Infinite finitely generated fields are biinterpretable with ℕ (Q3577298) (← links)
- AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS (Q5067872) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- UNIFORM DEFINABILITY OF INTEGERS IN REDUCED INDECOMPOSABLE POLYNOMIAL RINGS (Q5858916) (← links)
- Word automatic groups of nilpotency class 2 (Q6072210) (← links)
- Regular bi-interpretability of Chevalley groups over local rings (Q6166634) (← links)
