The following pages link to FA-presentable groups and rings (Q947484):
Displaying 15 items.
- Subalgebras of FA-presentable algebras. (Q466920) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Finite automata presentable Abelian groups (Q636284) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- Semiautomatic structures (Q1694004) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- Lamplighter groups and automata (Q2170284) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- Defining Multiplication in Some Additive Expansions of Polynomial Rings (Q2813650) (← links)
- Learning Pattern Languages over Groups (Q2830276) (← links)
- BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS (Q3110897) (← links)
- UNARY FA-PRESENTABLE SEMIGROUPS (Q3166269) (← links)
- Finitely Generated Semiautomatic Groups (Q3188266) (← links)
- Word automatic groups of nilpotency class 2 (Q6072210) (← links)
