EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 26 / No 1 (1992) RAIRO-Theor. Inf. Appl., 26 1 (1992) 45-58 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 26, Number 1, 1992
Page(s) 45 - 58
DOI https://doi.org/10.1051/ita/1992260100451
Published online 01 February 2017
  1. 1. A. ARNOLD, A Syntactic Congruence for Rational ω-languages, Theoret Comput. Sci., 1985, 39, pp. 333-335. [MR: 821211] [Zbl: 0578.68057] [Google Scholar]
  2. 2. A. ARNOLD and M. NIVAT, Comportements de processus, Rapport interne, L.I.T.P., 1982, pp. 82-12. [Google Scholar]
  3. 3. J. BERTSEL and D. PERRIN, Theory of Codes, Academic Press, New York, 1985. [MR: 797069] [Zbl: 0587.68066] [Google Scholar]
  4. 4. L. BOASSON and M. NIVAT, Adherences of Languages, J. Comput. System Sci., 1980, 20, pp. 285-309. [MR: 584863] [Zbl: 0471.68052] [Google Scholar]
  5. 5. J. R. BÜCHI, On Decision Method in Restricted Second-Order Arithmetics, Proc. Congr. Logic, Method. and Phulos. Sci., Stanford Univ. Press, 1962, p. 1-11. [MR: 183636] [Zbl: 0147.25103] [Google Scholar]
  6. 6. S. EILENBERG, Automata, Languages and Machines, A, Academic Press, New York, 1974. [MR: 530382] [Google Scholar]
  7. 7. H. JÜRGENSEN and G. THIERRIN, On ω-languages Whose Syntactic Monoid is Trivial, J. Comput. Inform. Sci., 1983, 12, pp. 359-365. [MR: 741785] [Zbl: 0545.68072] [Google Scholar]
  8. 8. L. H. LANDWEBER, Decision Problems for ω-Automata, Math. Syst. Theory, 1969, 3, pp. 376-384. [MR: 260595] [Zbl: 0182.02402] [Google Scholar]
  9. 9. M. LATTEUX and E. TIMMERAN, Finitely Generated ω-Languages, Inform Process. Lett., 1986, 23, pp. 171-175. [MR: 871375] [Zbl: 0627.68059] [Google Scholar]
  10. 10. R. LINDER and L. STAIGER, Algebraische Codierungstheorie-Theorie der sequentiellen Codierungen, Akademie-Verlag, Berlin, 1977. [MR: 469495] [Zbl: 0363.94016] [Google Scholar]
  11. 11. I. LITOVSKY, Générateurs des langages rationnels de mots infinis, Thèse, Univ. Lille-I, 1988. [Google Scholar]
  12. 12. I. LITOVSKY, and E. TIMMERMAN, On Generators of Rational ω-Power Languages, Theoret. Comput. Sci., 1987, 53, pp. 187-200. [MR: 918089] [Zbl: 0632.68080] [Google Scholar]
  13. 13. R. MACNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Inform. Control, 1966, 9, pp. 521-530. [MR: 213241] [Zbl: 0212.33902] [Google Scholar]
  14. 14. L. STAIGER, A Note on Connected ω-languages, Elektron. Inform. Kybernetik, 1980, 16, 5/6, pp. 245-251. [MR: 601279] [Zbl: 0452.68085] [Google Scholar]
  15. 15. L. STAIGER, Finite State ω-Languages, J. Comput. System Sci., 1983, 27, pp. 434-448. [MR: 727390] [Zbl: 0541.68052] [Google Scholar]
  16. 16. L. SAIGER, On Infinitary Finite Length Codes, Theore. Inform. Appli. 1986, 20, 4, pp. 483-494. [EuDML: 92273] [MR: 880849] [Zbl: 0628.68056] [Google Scholar]
  17. 17. L. STAIGER, Research in the Theory of ω-Languages, Elektron. Inform. Kybernetik, 1987, 23, 8/9, pp. 415-439. [MR: 923334] [Zbl: 0637.68095] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.