Free Access
Issue
RAIRO. Inform. théor.
Volume 11, Number 4, 1977
Page(s) 311 - 327
DOI https://doi.org/10.1051/ita/1977110403111
Published online 01 February 2017
  1. 1. A. ARNOLD et M. NIVAT, Non-Deterministic Recursive Program Schemes, à paraitre dans Fundamentals of Computation Theory, Lecture Notes in Computer Science, n° 56, p. 12-21, Springer Verlag, 1977. [MR: 502120] [Zbl: 0361.68020]
  2. 2. Y. CHOUEKA, Theories of Automata on ω-Tapes: a Simplified Approach, J. Comp. Syst. Sciences, vol. 8, 1974, p. 117-141. [MR: 342378] [Zbl: 0292.02033]
  3. 3. R. COHEN et A. GOLD, Theory of ω-Languages; Part I: Characterizations of ω-Context-Free Languagés, J. Comp. Syst. Sciences, vol. 15, 1977, p. 169-184. [MR: 483741] [Zbl: 0363.68113]
  4. 4. S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974. [MR: 530382] [Zbl: 0317.94045]
  5. 5. R. MCNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Inf. and Control, vol. 9, 1966, p. 521-530. [MR: 213241] [Zbl: 0212.33902]
  6. 6. M. P. SCHÜTZENBERGER, Push-Down Automata and Context-Free Languages, Inf. and Control, vol. 6, 1963, p. 246-264. [MR: 163809] [Zbl: 0123.12502]

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.