loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th Annual IEEE Symposium on Logic in Computer Science (LICS'02)
Some Results on Automatic Structures
Copenhagen, Denmark
July 22-July 25
ISBN: 0-7695-1483-9
ASCII Text
x 
 
Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin, "Some Results on Automatic Structures," Logic in Computer Science, Symposium on, pp. 235, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2002.1029832,
author = {Hajime Ishihara and Bakhadyr Khoussainov and Sasha Rubin},
title = {Some Results on Automatic Structures},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2002},
issn = {1043-6871},
pages = {235},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.1029832},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Some Results on Automatic Structures
SN - 1043-6871
SP
EP
A1 - Hajime Ishihara,
A1 - Bakhadyr Khoussainov,
A1 - Sasha Rubin,
PY - 2002
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Hajime Ishihara, Japan Advanced Institute of Science and Technology
Bakhadyr Khoussainov, University of Auckland
Sasha Rubin, University of Auckland
We study the class of countable structures which can be presented by synchronous finite automata. We reduce the problem of existence of an automatic presentation of a structure to that for a graph. We exhibit a series of properties of automatic equivalence structures, linearly ordered sets and permutation structures. These serve as a first step in producing practical descriptions of some automatic structures or illuminating the complexity of doing so for others.
Citation:
Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin, "Some Results on Automatic Structures," lics, pp.235, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.