Automata, semigroups and recognizability of words on ordinals

International Journal of Algebra and Computation

Volumn 8, Issue 1, 1998, Pages 1-21

  Bedon, Nicolas ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032345990     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218196798000028     Document Type: Article

References (18)

1. N. Bedon, Finite automata and ordinals, Theoret. Comput. Sci. 156 (1996) 119-144.
2. N. Bedon, Star-free sets of words on ordinals, to appear.
3. J. R. Büchi, On a decision method in the restricted second-order arithmetic, Logic, Methodology and Philosophy of Science: Proc. Intern. Congr., Stanford University Press, 1962, pp. 1-11.
4. J. R. Büchi, Transfinite automata recursions and weak second order theory of ordinals, Proc. Int. Congress Logic, Methodology, and Philosophy of Science, North-Holland Publ. Co., 1964, 2-23, Invited address.
5. J. R. Büchi, The monadic second order theory of all countable ordinals, Lecture Notes in Mathematics (Vol. 328), Springer, 1973.
6. n-tapes, J. Comp. Syst. Sci. 17 (1978), 81-97.
7. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, 1979.
8. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control, 9 (1966) 521-530.
9. D. Muller, Infinite sequences and finite machines, Switching circuit theory and logical design: Proc. Fourth Annual Symp. IEEE, 1963, pp. 3-16.
10. D. Perrin and J. E. Pin, Mots infinis, to appear (LITP report 97-04).
11. J. P. Pécuchet, Étude syntaxique des parties reconnaissables des mots infinis, Lecture Notes in Computer Science, 226 (1986) 294-303.
12. J. P. Pécuchet, Variétés de semigroupes et mots infinis, Lecture Notes in Computer Science, 210 (1986) 180-191.
13. J. E. Pin, Syntactic semigroups in Handbook of Formal Languages, Springer, 1997.
14. J. G. Rosenstein, Linear Ordering, Academic Press, New York, 1982.
15. M. P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control, 8 (1965) 190-194.
16. W. Sierpiński, Cardinal and Ordinal Numbers, Polish Scientific Publishers, Varsovie, 1965.
17. W. Thomas, Automata on infinite objects, in Handbook of Theoretical Computer Science, B, Elsevier, 1990, pp. 135-191.
18. T. Wilke, An Eilenberg theorem for ∞-languages, in Automata, Languages and Programming: Proc. of 18th ICALP Conference, Springer, Berlin, 1991, pp. 588-599.