A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
From Automatic Structures to Borel Structures
2008
Logic in Computer Science
We study the classes of Büchi and Rabin automatic structures. For Büchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relations, including the equality relation, and graphs of operations are recognized by Büchi (Rabin) automata. A Büchi (Rabin) automatic structure is injective if different infinite strings (trees) represent different elements of the structure. The first part of the paper is devoted to understanding the automatatheoretic content of
doi:10.1109/lics.2008.28
dblp:conf/lics/HjorthKMN08
fatcat:cko4fcoz3jczzkpfb4kyd462zq