Automata on linear orderings

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

Volumn 2136, Issue , 2001, Pages 236-247

  Bruyère, Véronique ^a   Carton, Olivier ^b  

^a UNIVERSITY OF MONS   (Belgium)

^b Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

INFINITE WORD; LINEAR ORDERINGS; RATIONAL EXPRESSIONS; SCATTERED LINEAR ORDERINGS;

SET THEORY;

EID: 84949814506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_21     Document Type: Conference Paper

References (22)

1. E. Asarin. Equations on timed languages. In T. Henzinger and S. Sastry, editors, Hybrid Systems: Computation and Control, number 1386 in Lect. Notes in Comput. Sci., pages 1-12, 1998.
2. E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 160-171, 1997.
3. N. Bedon and O. Carton. An Eilenberg theorem for words on countable ordinals. In Cláudio L. Lucchesi and Arnaldo V. Moura, editors, Latin’98: Theoretical Informatics, volume 1380of Lect. Notes in Comput. Sci., pages 53-64. Springer-Verlag, 1998.
4. B. Bérard and C. Picaronny. Accepting Zeno words without making time stand still. In Mathematical Foundations of Computer Science 1997, volume 1295 of Lect. Notes in Comput. Sci., pages 149-158, 1997.
5. P. Bouyer and A. Petit. A Kleene/Büchi-like theorem for clock languages. J. of Automata, Languages and Combinatorics, 2001. To appear.
6. J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik und grundl. Math., 6:66-92, 1960.
7. J. R. Büchi. On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pages 1-11. Stanford University Press, 1962.
8. J. R. Büchi. Transfinite automata recursions and weak second order theory of ordinals. In Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, pages 2-23. North Holland, 1965.
9. n-tapes. J. Comput. System Sci., 17(1):81-97, 1978.
10. B. Courcelle. Frontiers of infinite trees. RAIRO Theoretical Informatics, 12(4):319-337, 1978.
11. D. Girault-Beauquier. Bilimites de langages reconnaissables. Theoret. Comput. Sci., 33(2-3):335-342, 1984.
12. M. R. Hansen, P. K. Pandya, and Z. Chaochen. Finite divergence. Theoret. Comput. Sci., 138(1):113-139, 1995.
13. S. Heilbrunner. An algorithm for the solution of fixed-point equations for infinite words. RAIRO Theoretical Informatics, 14(2):131-141, 1980.
14. S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon, editor, Automata studies, pages 3-41. Princeton University Press, Princeton, 1956.
15. M. Nivat and D. Perrin. Ensembles reconnaissables de mots bi-infinis. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 47-59, 1982.
16. D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 1, pages 1-57. Elsevier, 1990.
17. J. G. Rosenstein. Linear ordering. Academic Press, New York, 1982.
18. S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379-419, 1975.
19. W. Thomas. On frontiers of regular sets. RAIRO Theoretical Informatics, 20:371-381, 1986.
20. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 133-191. Elsevier, 1990.
21. W. Thomas. Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht, number 1261 in Lect. Notes in Comput. Sci., pages 118-143. Springer-Verlag, 1997.
22. J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta Informaticæ, 8(3-4):379-396, 1985.