FA-presentable groups and rings
From MaRDI portal
Recommendations
- Finite presentability of Steinberg groups over group rings
- scientific article; zbMATH DE number 1221814
- scientific article; zbMATH DE number 7429
- scientific article; zbMATH DE number 679684
- scientific article; zbMATH DE number 1275478
- scientific article; zbMATH DE number 5865
- Finitely presented groups and completely regular semigroups
- Finitely presented expansions of groups, semigroups, and algebras
- scientific article; zbMATH DE number 1342231
- scientific article; zbMATH DE number 1215152
Cites work
- scientific article; zbMATH DE number 3875506 (Why is no real title available?)
- scientific article; zbMATH DE number 1189057 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1254101 (Why is no real title available?)
- scientific article; zbMATH DE number 2040323 (Why is no real title available?)
- scientific article; zbMATH DE number 848084 (Why is no real title available?)
- scientific article; zbMATH DE number 3415841 (Why is no real title available?)
- Automatic linear orders and trees
- Automatic semigroups
- Countably compact rings with periodic groups of units
- Describing Groups
- Examples of strongly \(\pi\)-regular rings.
- Finite Automata Presentable Abelian Groups
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- ON THE ELEMENTARY THEORY OF A FINITELY GENERATED ALMOST SOLVABLE GROUP
- On a correspondence between rings and groups
- Powers of rationals modulo 1 and rational base number systems
- STACS 2005
Cited in
(16)- Finite Automata Presentable Abelian Groups
- Lamplighter groups and automata
- Finite automata presentable Abelian groups
- Learning pattern languages over groups
- Eliminating unbounded search in computable algebra
- Defining multiplication in some additive expansions of polynomial rings
- Breaking up finite automata presentable torsion-free Abelian groups.
- Finitely generated semiautomatic groups
- The back-and-forth method and computability without delay
- Word automatic groups of nilpotency class 2
- Subalgebras of FA-presentable algebras.
- The isomorphism problem for tree-automatic ordinals with addition
- Learning pattern languages over groups
- Semiautomatic structures
- Unary FA-presentable semigroups
- Algebraic structures computable without delay
This page was built for publication: FA-presentable groups and rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947484)