72 search results - page 1 / 15 » The Isomorphism Problem on Classes of Automatic Structures |
LICS
2010
IEEE
13 years 2 months ago
2010
IEEE
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
DAM
1999
13 years 4 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...