Elementary theory of ordinals with addition and left translation by ω

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2295 LNCS, Issue , 2002, Pages 15-20

  Choffrut, Christian ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646167438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46011-x_2     Document Type: Conference Paper

References (13)

1. N. Bedon and O. Carton. An Eilenberg theorem for words on countable ordinals. In Proceedings of Latin'98 Theoretical Informatics, number 1380 in LNCS, pages 53-64. Springer-Verlag, 1998.
2. Alexis Bès. Decision problems related to the elementary theory of oordinal multiplication. Fund. Math., xxx(xxx):xxx. to appear.
3. J. Büchi. Transfinite automata recursions and weak second ordre theory of ordinals. In International Congress in Logic, Methodology and Philosophy of Sciences, pages 3-23. North-Holland, 1964.
4. C. Choffrut and S. Grigorieff. Uniformization of rational relations. In G. Paun J. Karhumäki, H. Maurer and G. Rozenberg, editors, Jewels are Forever, pages 59-71. Springer Verlag, 1999.
5. C. Choffrut and S. Horváth. Transfinite euqations in transfinite strings. Internat. J. Algebra Comput., 10(5):625-649, 2000.
6. S. C. Choueka. Finite automata, definable sets and regular expressions over ?n-tapes. J. Comput. System Sci., 17:81-97, 1978.
7. A. Ehrenfeucht. Applications of games to some problems of mathematical logic. Bull. Académie Polonaise des Sciences, 5:35-37, 1957.
8. S. Eilenberg. Automata, Languages and Machines, volume B. Academic Press, 1976.
9. D. Klaua. Allgemeine Mengenlehre. Akademie Verlag, 1969.
10. F. Maurin. Exact complexity bounds for ordinal addition. Theoret. Comput. Sci., 165(2):247-273, 1996.
11. F. Maurin. Ehrenfeucht games and ordinal addition. Annals of Pure and Applied Logic, 89(1):53-73, 1997.
12. W. Sierpiński. Cardinal and Ordinal Numbers. Warsaw: PWN, 1958.
13. J.Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta Informaticae, 8(3-4):379-396, 1985.