An eilenberg theorem for words on countable ordinals

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

Volumn 1380, Issue , 1998, Pages 53-64

  Bedon, Nicolas ^a   Carton, Olivier ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

ALGEBRAIC APPROACHES; ALGEBRAIC STRUCTURES; EILENBERG THEOREMS; SEMI-GROUP; SEMIGROUPS;

AUTOMATA THEORY;

EID: 84949204452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054310     Document Type: Conference Paper

References (19)

1. J. Almeida. Finite semigroups and universal algebra, volume 3 of Series in algebra. World Scientific, 1994.
2. A. Arnold. A syntactic congruence for rational w-languages. Theoretical Computer Science, 39:333-335, 1985.
3. N. Bedon. Automata, semigroups and recognizability of words on ordinals. IGM report 96-5, to appear in International Journal of Algebra and Computation.
4. N. Bedon. Star-free sets of words on ordinals. IGM report 97-8, submitted to Information and Computation.
5. J. R. Biichi. On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pages 11. Stanford University Press, 1962.
6. J. R. Büchi. Transfinite automata recursions and weak second order theory ofordinals. In Proe. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, pages 2-23. North-Holland, 1965.
7. Y. Choueka. Finite automata, definable sets, and regular expressions over wn-tapes. J. Comp. Syst. Sei., 17:81-97, 1978.
8. S. Eilenberg. Automata, languages and machines, volume B. Academic Press, 1976.
9. J.-P. Pécuchet. Etude syntaxique des parties reconnaissables de mots infinis. Lecture Notes in Computer Science, 226:294-303, 1986.
10. J.-P. Pécuchet. Variétés de semigroupes et mots infinis. Lecture Notes in Computer Science, 210:180-191, 1986.
11. D. Perrin. Recent results on automata and infinite words. In M. P. Chytil and V. Koubek, editors, Mathematical foundations of computer science, volume 176 of Lecture Notes in Computer Science, pages 134-148, Berlin, 1984. Springer.
12. D. Perrin and J.-E. Pin. Semigroups and automata on infinite words. In J. Fountain and V. A. R. Gould, editors, NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pages 49-72. Kluwer academic publishers, 1995.
13. J.-E. Pin. Handbook of formal languages, volume 1, chapter Syntactic semigroups, pages 679-746. Springer, 1997.
14. S. Rohde. Alternating automata and the temporal logic of ordinals. PhD thesis, University of Illinois, Urbana-Champaigu, 1997.
15. J. G. Rosenstein. Linear ordering. Academic Press, New York, 1982.
16. M. P. Schiitzenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190-194, 1965.
17. D. Thérien and T. Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996. To appear.
18. T. Wilke. An Eilenberg theorem for co-languages. In Automata, Languages and Programming: Proc. of 18th ICALP Conference, pages 588-599. Springer, 1991.
19. J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta informaticæ, 8(3-4):379-396, 1985.