Automatic linear orders and trees

ACM Transactions on Computational Logic

Volumn 6, Issue 4, 2005, Pages 675-700

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

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Automatic structures; Linear orders; Trees

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FINITE AUTOMATA; LINEAR SYSTEMS; SET THEORY; TREES (MATHEMATICS);

AUTOMATIC STRUCTURES; FINITE RANK; LINEAR ORDERS; TREES;

DATA STRUCTURES;

EID: 33745205530     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1094622.1094625     Document Type: Article

References (19)

1. BLUMENSATH, A. 1999. Automatic structures. Diploma Thesis, RWTH Aachen.
2. BLUMENSATH, A. AND GRÄDEL, E. 2000. Automatic structures. In Proceedings of the 15th Symposium on Logic in Computer Science (LICS2000). IEEE Computer Society Press, Los Alamitos, CA, 51-62.
3. DELHOMMÉ, C. 2004. Automaticité des ordinaux et des graphes homogénes. Comput. Rend. Math. 339, 1, 5-10.
4. DELHOMMÉ, C. 2004. Automaticité des ordinaux et des graphes homogènes. C.R. Acad. Sci. Paris Ser. I 339, 5-10.
5. EILENBERG, S., ELGOT, C., AND SHEPHERDSON, J. 1969. Sets recognized by n-tape automata. J. Alg. 13, 4, 447-464.
6. EPSTEIN, D. B. H., CANNON, J. W., HOLT, D. F., LEVY, S. V. F., PATERSON, M. S., AND THUHSTON, W. P. 1992. Word processing in groups. Jones and Bartlett.
7. HAUSDORFF, F. 1908. Grundzüge einer theorie der geordnete mengen. Math. Ann 65, 435-505.
8. ISHIHARA, H., KHOUSSAINOV, B., AND RUBIN, S. 2002. Some results on automatic structures. In Proceedings of the 17th Symposium on Logic in Computer Science (LICS2002). IEEE Computer Society Press, Los Alamitos, CA, 235-242.
9. KECHRIS, A. 1995. Classical Descriptive Set Theory. Springer-Verlag, New York.
10. KHOUSSAINOV, B. AND NERODE, A. 1994. Automatic presentations of structures. In Logic and Computational Complexity, International Workshop LOG 1994 (Indianapolis, IN), D. Leivant, Ed. Lecture Notes in Computer Science, vol. 960. Springer-Verlag, New York, 367-392.
11. KHOUSSAINOV, B. AND NERODE, A. 2001. Automata theory and its applications. Progress in Computer Science and Applied Logic, vol. 21. Birkhäuser Boston Inc., Boston, MA.
12. KHOUSSAINOV, B., NIES, A., RUBIN, S., AND STEPHAN, F. 2004a. Automatic structures: Richness and limitations. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, CA, 44-53.
13. KHOUSSAINOV, B. AND RUBIN, S. 2001. Graphs with automatic presentations over a unary alphabet. J. Automata, Lang. Combinat. 6, 4, 467-480.
14. KHOUSSAINOV, B. AND RUBIN, S. 2003. Automatic structures - Overview and future directions. J. Automata, Lang. Combinat. 8, 2, 287-301.
15. KHOUSSAINOV, B., RUBIN, S., AND STEPHAN, F. 2004b. Definability and regularity in automatic structures. In Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science (STAGS 2004). 440-451.
16. KUSKE, D. 2003. Is Cantor's theorem automatic ? In Proceedings of the 10th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2003). 330-343.
17. LOHREY, M. 2003. Automatic structures of bounded degree. In Proceedings of the 10th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2003). 344-358.
18. ROGERS, H. 1967. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York.
19. ROSENSTEIN, J. 1982. Linear Orderings. Academic Press, Orlando, FL.