On syntactic congruences for ω-languages

Theoretical Computer Science

Volumn 183, Issue 1, 1997, Pages 93-112

  Maler, Oded ^a   Staiger, Ludwig ^b  

^a VERIMAG   (France)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; FORMAL LOGIC;

FINITE SYNTACTIC MONOIDS; MINIMAL STATE AUTOMATON; SYNTACTIC CONGRUENCES;

FORMAL LANGUAGES;

EID: 0031209059     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00312-X     Document Type: Article

References (21)

1. A. Arnold, A syntactic congruence for rational ω-languages, Theoret. Comput. Sci. 39 (1985) 333-335.
2. Do Long Van, B. LeSaëc, I. Litovsky, Characterizations of rational ω-languages by means of right congruences, Theoret. Comput. Sci. 143 (1995) 1-21.
3. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.
4. J. Engelfriet, H.J. Hoogeboom, X-automata on ω-words, Theoret. Comput. Sci. 110 (1993) 1-51.
5. H.J. Hoogeboom, G. Rozenberg, Infinitary languages - basic theory and applications to concurrent systems, in: J.W. de Bakker et al. (Eds.), Current Trends in Concurrency, Lecture Notes in Computer Science, vol. 224, Springer, Berlin, 1985, pp. 266-342.
6. H. Jürgensen, G. Thierrin, On ω-languages whose syntactic monoid is trivial, Internat. J. Comput. Inform. Sci. 12 (1983) 359-365.
7. K. Kuratowski, Topology I, Academic Press, New York, 1966.
8. B. LeSaëc, Saturating right congruences, RAIRO Infor. théor. et Appl. 24 (1990) 545-560.
9. R. Lindner, L. Staiger, Algebraische Codierungstheorie - Theorie der sequentiellen Codierungen, Akademie, Berlin, 1977.
10. O. Maler, A. Pnueli, On the learnability of infinitary regular sets, in: L.G. Valiant, M.K. Warmuth, Proc. 4th Annual Workshop on Computational Learning Theory, Morgan Kaufmann, San Mateo, 1991.
11. D.E. Muller, Infinite sequences and finite machines, in: Proc. 4th Ann. IEEE Symp. Switching Theory and Logical Design, Chicago, 1963, pp. 3-16.
12. D. Perrin, J.-E. Pin, Mots Infinis, Report LITP 93.40, Institut Biaise Pascal, Paris, 1993.
13. L. Staiger, Finite-state ω-languages, J. Comput. System Sci. 27 (1983) 434-448.
14. L. Staiger, Research in the Theory of ω-languages, J. Inf. Process. Cybern. EIK 23 (1987) 415-439.
15. L. Staiger, K. Wagner, Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen, Elktron. Informationsverarb. Kybernet. EIK 10 (1974) 379-392.
16. W. Thomas, Automata on infinite objects, in: J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, pp. 133-191.
17. B.A. Trakhtenbrot, Finite automata and monadic second order logic, Siberian Math. J. 3 (1962) 103-131 (in Russian). English translation in: AMS Transl. 59 (1966) 23-55.
18. B.A. Trakhtenbrot, Finite automata and monadic second order logic, Siberian Math. J. 3 (1962) 103-131 (in Russian). English translation in: AMS Transl. 59 (1966) 23-55.
19. K. Wagner, On ω-regular sets, Inform. and Control 43 (1979) 123-177.
20. Th. Wilke, An Eilenberg theorem for ∞-languages, in: J. Albert Leach, B. Monien, M. Rodríguez Artalejo (Eds.), Proc. 18th. Internat. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 510, Springer, Berlin 1991, pp. 588-599.
21. Th. Wilke, An algebraic theory for regular languages of finite and infinite words, Internat. J. Algebra Comput. 3 (1993) 447-489.