We also present an automatic structure of bounded degree such that the corresponding first-order theory has a lower bound of doubly exponential time with a ...

Oct 28, 2008 · We prove that the first-order theory of a string automatic structure of bounded degree is decidable in doubly exponential space (for injective ...

We investigate, for the first time, the complexity of the uniform first-order theory (where the automatic presentation is part of the input) of string/tree.

A structure has bounded degree, if in its Gaifman graph, the number of neighbors of a node is bounded by some fixed constant. The paper [14] also presents a ...

We investigate, for the first time, the complexity of the uniform first-order theory (where the automatic presentation is part of the input) of string/tree.

In this paper we will present such a subclass, namely automatic structures of bounded degree, where the bounded degree property refers to the Gaifman-graph of ...

It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for ...

We prove that the first-order theory of a string automatic structure of bounded degree is decidable in doubly exponential space (for injective automatic ...

A structure has bounded degree, if in its Gaifman graph, the number of neighbors of a node is bounded by some fixed constant. The paper [24] also presents a ...

We prove that the first-order theory of a string automatic structure of bounded degree is decidable in doubly exponential space (for injective automatic ...