Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Abstract. 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 injective automa...
This is the first paper that proposes automatic image annotation using the semantics of XML. In this paper, we propose XPRM - XML Path based Relevance Model for automatic image a...