Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is \Pi^0_1-complete, (ii) The isomorphism problem for automatic trees of height n≥2 is \Pi^0_{2n-3}-complete, (iii) The isomorphism problem for automatic linear orders is not arithmetical
Abstract. This paper addresses the complexity of several families of queries in classes of unary aut...
AbstractGraph isomorphism problem has always been mathematics and engineering technology community c...
Theories of classification distinguish classes with some good structure theorem from those for which...
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) T...
Automatic structures are finitely presented structures where the universe and all relations can be r...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
AbstractThe main result of this paper states that the isomorphism problem for ω-automatic trees of f...
The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
We prove the undecidability of the existence of an isomorphism between scattered tree-automatic line...
International audienceAn $\omega$-tree-automatic structure is a relational structure whose domain an...
In this paper we study the class EqP of automatic equivalence structures of the form ?=(D, E) where ...
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
Abstract We consider the complexity of the isomorphism relation on countable first-order structures ...
This paper addresses the time complexity of several queries (including membership and isomorphism) i...
Abstract. This paper addresses the complexity of several families of queries in classes of unary aut...
AbstractGraph isomorphism problem has always been mathematics and engineering technology community c...
Theories of classification distinguish classes with some good structure theorem from those for which...
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) T...
Automatic structures are finitely presented structures where the universe and all relations can be r...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
AbstractThe main result of this paper states that the isomorphism problem for ω-automatic trees of f...
The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
We prove the undecidability of the existence of an isomorphism between scattered tree-automatic line...
International audienceAn $\omega$-tree-automatic structure is a relational structure whose domain an...
In this paper we study the class EqP of automatic equivalence structures of the form ?=(D, E) where ...
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
Abstract We consider the complexity of the isomorphism relation on countable first-order structures ...
This paper addresses the time complexity of several queries (including membership and isomorphism) i...
Abstract. This paper addresses the complexity of several families of queries in classes of unary aut...
AbstractGraph isomorphism problem has always been mathematics and engineering technology community c...
Theories of classification distinguish classes with some good structure theorem from those for which...
DOI
Add to ORKG