9 citations · 39 across the 30 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.GR2010
Algorithmically finite groups
A. Myasnikov, D. Osin
We call a group {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of . We construct examples of recursively presented in…
math.GR2010
Group extensions over infinite words
Volker Diekert, Alexei Myasnikov
We construct an extension of a given group by infinite non-Archimedean words over an discretely ordered abelian group like . This yields an effective and uniform…