Free Access
RAIRO-Theor. Inf. Appl.
Volume 24, Number 6, 1990
Page(s) 545 - 559
Published online 01 February 2017
  1. [AR (84)] A. ARNOLD, Deterministic and non-anbiguous rational w-languages, L.N.C.S., 1984, n° 192, pp. 18-27. [MR: 814729] [Zbl: 0612.68073] [Google Scholar]
  2. [BU (62)] J. R. BÜCHI, On a decision method in restricted second order arithmetic, Proc. Internat. Congress on Logic, Methodology and philosophy, Stanford Univ. Press, 1962, pp. 1-11. [MR: 183636] [Zbl: 0147.25103] [Google Scholar]
  3. [EI (74)] S. EILENBERG, Automata, Languages and Machines, Vol. A., Academic Press, 1974. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  4. [LA (69)] L. H. LANDWEBER, Decision problems for w-automata, Math. Sys. Theor., 1969, 3, pp. 376-384. [MR: 260595] [Zbl: 0182.02402] [Google Scholar]
  5. [LS (86)] B. LE SAEC, Thèse de doctorat. Étude de la reconnaissabilité des langages rationnels de mots infinis, 1986, n° 85, Université de Bordeaux. [Google Scholar]
  6. [MN (66)] R. MCNAUGHTON, Testing and generating infinité sequences by finite automaton. Information and control, 1966, n° 9, pp. 521-530. [MR: 213241] [Zbl: 0212.33902] [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.