(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, finitely generated, orbit undecidable, free subgroups of GLd(Z), for d⩾6, and Aut(Fd), for d⩾5, are constructed as well.Peer Reviewe
A group tessellation automaton (TA) is one whose state alphabet consists of the elements of a group,...
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural re...
AbstractWe investigate the complexity of algorithmic problems on finitely generated subgroups of fre...
(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphi...
Abstract(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree au...
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by us...
Abstract. We associate a finite directed graph with each equivalence class of words in F2 under AutF...
We investigate the complexity of algorithmic problems on finitely generated subgroups of free groups...
The conjugacy problem and the inverse conjugacy problem of a finitely generated group are defined, f...
Abstract. We study the conjugacy problem in cyclic extensions of free groups. It is shown that the c...
International audienceWe remark that the conjugacy problem for pairs of hyperbolic automorphisms of ...
Given a short exact sequence of groups with certain conditions, 1 ? F ? G ? H ? 1, weprove that G ha...
International audienceIn a previous work, we remarked that the conjugacy problem for pairs of atoroi...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related t...
A group tessellation automaton (TA) is one whose state alphabet consists of the elements of a group,...
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural re...
AbstractWe investigate the complexity of algorithmic problems on finitely generated subgroups of fre...
(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphi...
Abstract(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree au...
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by us...
Abstract. We associate a finite directed graph with each equivalence class of words in F2 under AutF...
We investigate the complexity of algorithmic problems on finitely generated subgroups of free groups...
The conjugacy problem and the inverse conjugacy problem of a finitely generated group are defined, f...
Abstract. We study the conjugacy problem in cyclic extensions of free groups. It is shown that the c...
International audienceWe remark that the conjugacy problem for pairs of hyperbolic automorphisms of ...
Given a short exact sequence of groups with certain conditions, 1 ? F ? G ? H ? 1, weprove that G ha...
International audienceIn a previous work, we remarked that the conjugacy problem for pairs of atoroi...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related t...
A group tessellation automaton (TA) is one whose state alphabet consists of the elements of a group,...
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural re...
AbstractWe investigate the complexity of algorithmic problems on finitely generated subgroups of fre...
DOI
Add to ORKG