We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic linear orders, we determine the exact level of undecidability in the arithmetical hierarchy
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-...
Abstract. This paper addresses the complexity of several families of queries in classes of unary aut...
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of ...
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...
Abstract. Bruyère and Carton lifted the notion of finite automata reading infinite words to finite ...
International audienceAn $\omega$-tree-automatic structure is a relational structure whose domain an...
Abstract. We study tree-automatic linear orders on regular tree lan-guages. We first show that there...
AbstractThe main result of this paper states that the isomorphism problem for ω-automatic trees of f...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
To appear in The Journal of Symbolic LogicInternational audienceWe consider $\omega^n$-automatic str...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height...
Automatic structures are—possibly infinite—structures which are finitely presentable by means of fin...
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-...
Abstract. This paper addresses the complexity of several families of queries in classes of unary aut...
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of ...
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...
Abstract. Bruyère and Carton lifted the notion of finite automata reading infinite words to finite ...
International audienceAn $\omega$-tree-automatic structure is a relational structure whose domain an...
Abstract. We study tree-automatic linear orders on regular tree lan-guages. We first show that there...
AbstractThe main result of this paper states that the isomorphism problem for ω-automatic trees of f...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
To appear in The Journal of Symbolic LogicInternational audienceWe consider $\omega^n$-automatic str...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height...
Automatic structures are—possibly infinite—structures which are finitely presentable by means of fin...
We study the existence of automatic presentations for various algebraic structures. An automatic pre...
We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-...
Abstract. This paper addresses the complexity of several families of queries in classes of unary aut...
DOI
Add to ORKG