We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the conjugacy problem in the case of automorphisms of several nonregularly branching trees
The closed subgroups of the group of permutations of N coincide with the automorphism groups of cou...
In this paper, various algorithms used in the classifications of regular polytopes for given groups ...
We prove that branch groups of automorphisms of regular rooted trees can not have polynomial conjuga...
We identify the complexity of the classification problem for automorphisms of a given countable regu...
In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees...
In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees...
In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees...
We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous s...
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogen...
We present an overview of the recent developments in the study of the classification problem for aut...
We present an overview of the recent developments in the study of the classification problem for aut...
We show that for any countable homogeneous ordered graph G, the conjugacy problem for automorphisms ...
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogen...
Abstract. We show that it is decidable whether a given a regular tree language belongs to the class∆...
In this paper, we consider infinitely sorted tree algebras recognising regular language of finite tr...
The closed subgroups of the group of permutations of N coincide with the automorphism groups of cou...
In this paper, various algorithms used in the classifications of regular polytopes for given groups ...
We prove that branch groups of automorphisms of regular rooted trees can not have polynomial conjuga...
We identify the complexity of the classification problem for automorphisms of a given countable regu...
In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees...
In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees...
In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees...
We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous s...
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogen...
We present an overview of the recent developments in the study of the classification problem for aut...
We present an overview of the recent developments in the study of the classification problem for aut...
We show that for any countable homogeneous ordered graph G, the conjugacy problem for automorphisms ...
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogen...
Abstract. We show that it is decidable whether a given a regular tree language belongs to the class∆...
In this paper, we consider infinitely sorted tree algebras recognising regular language of finite tr...
The closed subgroups of the group of permutations of N coincide with the automorphism groups of cou...
In this paper, various algorithms used in the classifications of regular polytopes for given groups ...
We prove that branch groups of automorphisms of regular rooted trees can not have polynomial conjuga...
DOI
Add to ORKG