Accessibility in automata on scattered linear orderings

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

Volumn 2420, Issue , 2002, Pages 155-164

  Carton, Olivier ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS; SET THEORY;

LINEAR ORDERINGS; NUMBER OF STATE; SCATTERED LINEAR ORDERINGS;

AUTOMATA THEORY;

EID: 84956989752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_12     Document Type: Conference Paper

References (18)

1. [1] V. Bruyère and O. Carton. Automata on linear orderings. In J. Sgall, A. Pultr, and P. Kolman, editors, MFCS’2001, volume 2136 of Lect. Notes in Comput. Sci., pages 236–247, 2001. IGM report 2001-12.
2. [2] J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik und grundl. Math., 6:66–92, 1960.
3. [3] 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.
4. [4] 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.
5. [5] Y. Choueka. Finite automata, definable sets, and regular expressions over ωn- tapes. J. Comput. System Sci., 17(1):81–97, 1978.
6. [6] S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, New York, 1972.
7. [7] D. Girault-Beauquier. Bilimites de langages reconnaissables. Theoret. Comput. Sci., 33(2–3):335–342, 1984.
8. [8] 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.
9. [9] S. C. Krishnan, A. Puri, and R. K. Brayton. Structural complexity of ω-languages. In STACS’95, volume 900 of Lect. Notes in Comput. Sci., pages 143–156, Berlin, 1995. Springer-Verlag.
10. [10] D. Muller. Infinite sequences and finite machines. In Proc. of Fourth Annual IEEE Symp., editor, Switching Theory and Logical Design, pages 3–16, 1963.
11. [11] 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.
12. [12] M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1–35, 1969.
13. [13] E. Roche and Y. Schabes. Finite-State Language Processing, chapter 7. MIT Press, Cambridge, 1997.
14. [14] J. G. Rosenstein. Linear ordering. Academic Press, New York, 1982.
15. [15] M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, volume 1043 of Lect. Notes in Comput. Sci., pages 238–266. Springer-Verlag, 1996.
16. [16] T. Wilke and H. Yoo. Computing the Rabin index of a regular language of infinite words. Inform. Comput., 130(1):61–70, 1996.
17. [17] J. Wojciechowski. Classes of transfinite sequences accepted by finite automata. Fundamenta informaticæ, 7(2):191–223, 1984.
18. [18] J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta informaticæ, 8(3-4):379–396, 1985.