Automaticity of ordinals and of homogeneous graphs;Automaticité des ordinaux et des graphes homogènes

Comptes Rendus Mathematique

Volumn 339, Issue 1, 2004, Pages 5-10

  Delhommé, Christian ^a  

^a UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2942661707     PISSN: 1631073X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.crma.2004.03.035     Document Type: Article

References (15)

1. Abraham U. Bonnet R. Hausdorff's theorem for posets that satisfy the finite antichain property Fund. Math. 159 1 1999 51-69
2. A. Blumensath, Automatic Structures, Diploma Thesis, RWTH, University of Aachen, 1999
3. Blumensath A. Graedel E. Automatic structures LICS'00 2000 51-62
4. Carruth P.W. Arithmetic of ordinals with applications to the theory of ordered Abelian groups Bull. Amer. Math. Soc. 48 1942 262-271
5. Common H. Dauchet M. Gilleron R. Lugiez D. Tison S. Tomassi M. TATA: Tree Automata and Their Applications http://l3ux02.univ-lille3.fr/tata/
6. Dauchet M. Tison S. The theory of ground rewrite systems is decidable LICS'90 1990 242-248 IEEE
7. C. Delhommé, Rado's graph is not automatic, Manuscript, 2001
8. ωManuscript, 2001
9. C. Delhommé, V. Goranko, T. Knapik, Automatic linear orderings, Manuscript, 2002
10. Fraïssé R. Theory of relations Stud. Logic vol. 118 1986 North-Holland
11. Frougny C. Sakarovitch J. Synchronized rational relations of finite and infinite words Theoret. Comput. Sci. 108 1993 45-82
12. B.R. Hodgson, Théories décidables par automate fini, Thèse de doctorat, Université de Montréal, 1976, 171 p
13. Hodgson B.R. Décidabilité par automate fini Ann. Sci. Math. Québec 7 1 1983 39-57
14. Khoussainov B. Nerode A. Automatic presentations of structures Logic and Comput. Complex., Lecture Notes in Comput. Sci. vol. 960 1995 367-392
15. B. Khoussainov, S. Rubin, F. Stephan, On automatic partial orders, Manuscript, 2003