Automatic structures: Richness and limitations

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 44-53

  Khoussainov, Bakhadyr ^a   Rubin, Sasha ^a   Nies, Andre ^a   Stephan, Frank ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; GRAPH THEORY; QUERY LANGUAGES; SET THEORY; THEOREM PROVING;

ALGEBRAIC STRUCTURES; AUTOMATIC STRUCTURES; INFINITE STATE TRANSITION SYSTEMS; ISOMORPHISM;

BOOLEAN ALGEBRA;

EID: 4544240773     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319599     Document Type: Conference Paper

References (13)

1. M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. A Model-Theoretic approach to regular string relations. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001), pages 431-440, June 16-19 2001.
2. C. H. Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 17(6):525-532, November 1973.
3. A. Blumensath. Automatic Structures. Diploma thesis, RWTH Aachen, 1999.
4. A. Blumensath and E. Grädel. Automatic structures. In 15th Symposium on Logic in Computer Science (LICS 2000), pages 51-62, June 2000.
5. ω, 2001. manuscript.
6. C. Delhomme. The rado graph is not automatic, 2001. manuscript.
7. S. Eilenberg, C.C. Elgot, and J.C. Shepherdson. Sets recognised by n-tape automata. Journal of Algebra, 13(4):447-464, 1969.
8. S.S. Goncharov and J.F. Knight. Computable structure and non-structure theorems. Algebra and Logic, 41(6):351-373, 2002.
9. W. A. Hodges. Model Theory. Cambridge University Press, 1993.
10. H. Ishihara, B. Khoussainov, and S. Rubin. Some results on automatic structures. In 17th Symposium on Logic in Computer Science (LICS 2002), pages 235-242, July 2002.
11. B. Khoussainov and A. Nerode. Automatic presentations of structures. Lecture Notes in Computer Science, 960:367-392, 1995.
12. B. Khoussainov, S. Rubin, and F. Stephan. Automatic linear orders and trees, 2003. CDMTCS technical report 208, Department of Computer Science, University of Auckland.
13. S. Rubin. Automatic Structures. Phd thesis, University of Auckland, 2004. In preparation.