EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 13 / No 3 (1979) RAIRO. Inform. théor., 13 3 (1979) 241-250 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 13, Number 3, 1979
Page(s) 241 - 250
DOI https://doi.org/10.1051/ita/1979130302411
Published online 01 February 2017
  1. 1. R. V. BOOK, Comparing Complexity Classes, J. Comput. System Sc., Vol. 9, 1974, pp. 213-229. [MR: 366099] [Zbl: 0331.02020] [Google Scholar]
  2. 2. K. CULIK II, On Some Families of Languages Related to Developmental Systems, Intern. J. Comput. Math., Vol. 4, 1974, pp. 31-42. [MR: 363009] [Zbl: 0294.68025] [Google Scholar]
  3. 3. K. CULIK II, A Purely Homomorphic Characterization of Recursive Enumerable Sets, J. Assoc. Comput. Mach., Vol. 26, 1979, pp. 345-350. [MR: 528036] [Zbl: 0395.68076] [Google Scholar]
  4. 4. K. CULIK II and H. A. MAURER, Propagating Chain-Free Normal Forms for EOL Systems, Information and Control, Vol. 36, 1978, pp. 309-319. [MR: 468336] [Zbl: 0368.68071] [Google Scholar]
  5. 5. S. EILENBERG, Automata, Languages and Machines, Vol. A, Academic Press, 1974. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  6. 6. J. ENGELFRIET and G. ROZENBERG, Fixed Point Languages, Equality Languages and Representations of Recursively Enumerable Languages, 19th Annual Symposium on Foundations of Computer Science, 1978, pp. 123-126. [Zbl: 0475.68047] [Google Scholar]
  7. 7. S. GINSBURG, Algebraic and Automata-Theoretic Properties of Formal Languages, North Holland, Amsterdam, 1975. [MR: 443446] [Zbl: 0325.68002] [Google Scholar]
  8. 8. S. GREIBACH, The Hardest CF Language, S.I.A.M. J. Comput., Vol. 2, 1973, pp. 304-310. [MR: 334591] [Zbl: 0278.68073] [Google Scholar]
  9. 9. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
  10. 10. J. E. HOPCROFT and J. D. ULLMAN, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. [MR: 237243] [Zbl: 0196.01701] [Google Scholar]
  11. 11. H. A. MAURER, Theoretische Grundlagen der Programmiersprachen, BI, Marmheim, 1969. [MR: 403292] [Zbl: 0204.31801] [Google Scholar]
  12. 12. A. SALOMAA, Formal Languages, Academic Press, New York, 1973. [MR: 438755] [Zbl: 0262.68025] [Google Scholar]
  13. 13. A. SALOMAA, Theory of Automata, Pergamon Press, London, 1969. [MR: 262021] [Zbl: 0193.32901] [Google Scholar]
  14. 14. B. WEGBREIT, A Generator of Context Sensitive Languages, J. Comput. System Sc., Vol. 3, 1969, pp. 456-461. [MR: 284301] [Zbl: 0205.31302] [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.