EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 8 / No R1 (1974) R.A.I.R.O. Informatique théorique, 8 R1 (1974) 37-48 References
Free Access
Issue
R.A.I.R.O. Informatique théorique
Volume 8, Number R1, 1974
Page(s) 37 - 48
DOI https://doi.org/10.1051/ita/197408R100371
Published online 01 February 2017
  1. ROGERS H., Theory of Recursive Functions and Effective computability, McGraw Hill (1966). [MR: 224462] [Zbl: 0183.01401] [Google Scholar]
  2. GRZEGORCZYK A., Some Classes of Recursive Function, Rozprawy Maternatyczne, pp. 1-46 (1953). [EuDML: 219317] [MR: 60426] [Zbl: 0052.24902] [Google Scholar]
  3. PETER R., Recursive Functions, Academic Press (1966). [MR: 219414] [Zbl: 0154.00601] [Google Scholar]
  4. BLUM M., A machine-Independent Theory of the Complexity of Recursive Functions, JACM, vol. 14, n° 2, Appril (1967), pp. 322-336. [MR: 235912] [Zbl: 0155.01503] [Google Scholar]
  5. FLAJOLET P. et STEYAERT J. M., Generalised Immune Sets, Rapport IRIA (1973). [Google Scholar]
  6. CONSTABLE R., Hierarchy Theorems for Axiomatic Complexity, Computational Complexity, pp. 37-63, edited by Randall Rustin-Algorithmics Press Inc (1973). [Google Scholar]
  7. FLAJOLET P. et STEYAERT J. M., Une Formalisation de la Notion d'Algorithme de Tri non Récurrent. Thèse de 3e cycle, Paris VII (1973). [Google Scholar]
  8. CUDIA D., The degree hierarchy of undecidable problems of formal grammars, ACM-SIGACT Symposium (1970). [Zbl: 0169.31302] [Google Scholar]
  9. LEWIS F. D., On Unsolvability in Subrecursive Classes of Predicates, Harvard University report (1972). [Zbl: 0316.02050] [Google Scholar]
  10. MEYER A. et RITCHIE D., Computational Complexity and Program Structure, IBM research report RC 1817 (1967). [Google Scholar]
  11. IBARRA O., On two way Multihead Automata, JCSS 7, 28-36 (1973). [MR: 408317] [Zbl: 0256.68028] [Google Scholar]
  12. ROSENBERG A., On multihead Finite Automata, IBM Journal (1966), 388-394. [Zbl: 0168.01303] [Google Scholar]
  13. FLAJOLET P. et STEYAERT J. M., Decision Problems for Multihead Finite Automata. Proceedings of MFCS Symposium, pp. 225-230 (1973). [MR: 408315] [Google Scholar]
  14. MEYER A. et FISCHER M., Economy of Description by Automata, Grammars and Formal Systems. Conference Record (1971). 12tl Annual Sympon Switching an Automata Theory, pp. 188-191. [Google Scholar]
  15. MEYER A. Program Size, in Restricted Programming Languages, Information and Control, 21, 382-394 (1972). [MR: 321343] [Zbl: 0301.68019] [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.