Une généralisation de la notion d'ensemble immune

Philippe Flajolet; Jean-Marc Steyaert

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1974)

  • Volume: 8, Issue: R1, page 37-48
  • ISSN: 0988-3754

How to cite

top

Flajolet, Philippe, and Steyaert, Jean-Marc. "Une généralisation de la notion d'ensemble immune." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 8.R1 (1974): 37-48. <http://eudml.org/doc/92004>.

@article{Flajolet1974,
author = {Flajolet, Philippe, Steyaert, Jean-Marc},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {R1},
pages = {37-48},
publisher = {EDP-Sciences},
title = {Une généralisation de la notion d'ensemble immune},
url = {http://eudml.org/doc/92004},
volume = {8},
year = {1974},
}

TY - JOUR
AU - Flajolet, Philippe
AU - Steyaert, Jean-Marc
TI - Une généralisation de la notion d'ensemble immune
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1974
PB - EDP-Sciences
VL - 8
IS - R1
SP - 37
EP - 48
LA - fre
UR - http://eudml.org/doc/92004
ER -

References

top
  1. [1] ROGERS H., Theory of Recursive Functions and Effective computability, McGraw Hill (1966). Zbl0183.01401MR224462
  2. [2] GRZEGORCZYK A., Some Classes of Recursive Function, Rozprawy Maternatyczne, pp. 1-46 (1953). Zbl0052.24902MR60426
  3. [3] PETER R., Recursive Functions, Academic Press (1966). Zbl0154.00601MR219414
  4. [4] BLUM M., A machine-Independent Theory of the Complexity of Recursive Functions, JACM, vol. 14, n° 2, Appril (1967), pp. 322-336. Zbl0155.01503MR235912
  5. [5] FLAJOLET P. et STEYAERT J. M., Generalised Immune Sets, Rapport IRIA (1973). 
  6. [6] CONSTABLE R., Hierarchy Theorems for Axiomatic Complexity, Computational Complexity, pp. 37-63, edited by Randall Rustin-Algorithmics Press Inc (1973). 
  7. [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). 
  8. [8] CUDIA D., The degree hierarchy of undecidable problems of formal grammars, ACM-SIGACT Symposium (1970). Zbl0169.31302
  9. [9] LEWIS F. D., On Unsolvability in Subrecursive Classes of Predicates, Harvard University report (1972). Zbl0316.02050
  10. [10] MEYER A. et RITCHIE D., Computational Complexity and Program Structure, IBM research report RC 1817 (1967). 
  11. [11] IBARRA O., On two way Multihead Automata, JCSS 7, 28-36 (1973). Zbl0256.68028MR408317
  12. [12] ROSENBERG A., On multihead Finite Automata, IBM Journal (1966), 388-394. Zbl0168.01303
  13. [13] FLAJOLET P. et STEYAERT J. M., Decision Problems for Multihead Finite Automata. Proceedings of MFCS Symposium, pp. 225-230 (1973). MR408315
  14. [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. 
  15. [15] MEYER A.Program Size, in Restricted Programming Languages, Information and Control, 21, 382-394 (1972). Zbl0301.68019MR321343

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.