Free Access
RAIRO. Inform. théor.
Volume 15, Number 1, 1981
Page(s) 67 - 94
Published online 01 February 2017
  1. 1. R. L. CONSTABLE, Type Two Computational Complexity, in Proceedings of the Fifth Annual A.C.M. Symposium on the Theory of Computing, May 1973. [MR: 416106] [Zbl: 0306.68022] [Google Scholar]
  2. 2. K. WEIHRAUCH, The Computational Complexity of Program Schemata, J. Comput. Syst. Sc., Vol. 12, 1976, pp. 80-107. [MR: 400790] [Zbl: 0321.68036] [Google Scholar]
  3. 3. Y. IGARASHI, On the Complexity of Generalized Monadic Recursion Schemes, Systems. Computers. Controls, Vol. 5, 1974, pp.18-25. [MR: 403288] [Google Scholar]
  4. 4. St. J. GARLAND and D. C. LUCKHAM, Program Schemes, Recursion Schemes, and Formal Languages, J. Comput. Syst. Sc., Vol. 7, 1973, pp. 119-160. [MR: 315930] [Zbl: 0277.68010] [Google Scholar]
  5. 5. Sh. A. GREIBACH, Theory of Program Structures: Schemes, Semantics, Verification, Lecture Notes in Comput. Sc.,Vol. 36, 1975. [MR: 431768] [Zbl: 0345.68002] [Google Scholar]
  6. 6. A. Ja. DIKOVSKII, General Theory of Derivation Complexity and Syntactic Description in Context-Free Grammars, in A. V. GLADKII, Formal Grammars and Languages, Nauka, M., 1973, 9th chapter added in translation (submitted for translation into English in North-Holland Publishing Co.). [Google Scholar]
  7. 7. A. Ja. DIKOVSKII, A General Notion of Complexity of Derivation and Syntactic Description in Context-Free Grammar, in Semiotika i informatika, Vol. 7, M., 1977, pp. 83-105 (Russ.). [MR: 663229] [Google Scholar]
  8. 8. A. Ja. DIKOVSKII, Classifications of Context-Free Languages by Dérivation Complexity (submitted for publication in Semiotika i informatika) (Russ.). [Zbl: 0482.68068] [Google Scholar]
  9. 9. A. Ja. DIKOVSKII, Derivation Complexity of Unambiguous Context-Free Grammars and Languages (submitted for publication in Semiotika i informatika) (Russ.). [Google Scholar]
  10. 10. F. HARARY, Graph Theory, Addison-Wesley Publ. Co., Reading, Mass., 1969. [MR: 256911] [Zbl: 0182.57702] [Google Scholar]
  11. 11. A. Ja. DIKOVSKII, Languages of Bounded Active Capacity, Soviet Math. Dokl., Vol. 11, 1970, pp. 748-750. [Zbl: 0209.31002] [Google Scholar]
  12. 12. A. Ja. DIKOVSKII, Density of Derivation Trees and Active Capacity of Grammars, Problemy peredaci informacii, Vol. 8, 1972, pp. 88-98 (Russ.). [MR: 334587] [Zbl: 0357.68080] [Google Scholar]
  13. 13. A. V. GLADKY, Formal Grammars and Languages, Nauka, M., 1973 submitted for translation from Russian into English in North-Holland Publ. Co.). [Google Scholar]
  14. 14. W. OGDEN, A Helpful Result for Proving Inherent Ambiguity, Math. Syst. Theory, Vol. 2, 1968, pp. 191-194. [MR: 233645] [Zbl: 0175.27802] [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.