@article{ITA_1974__8_1_37_0,
author = {Flajolet, Philippe and Steyaert, Jean-Marc},
title = {Une g\'en\'eralisation de la notion d'ensemble immune},
journal = {Revue fran\c{c}aise d'automatique informatique recherche op\'erationnelle. Informatique th\'eorique},
pages = {37--48},
year = {1974},
publisher = {Dunod-Gauthier-Villars},
address = {Paris},
volume = {8},
number = {R1},
mrnumber = {349364},
zbl = {0283.02034},
language = {fr},
url = {https://www.numdam.org/item/ITA_1974__8_1_37_0/}
}
TY - JOUR AU - Flajolet, Philippe AU - Steyaert, Jean-Marc TI - Une généralisation de la notion d'ensemble immune JO - Revue française d'automatique informatique recherche opérationnelle. Informatique théorique PY - 1974 SP - 37 EP - 48 VL - 8 IS - R1 PB - Dunod-Gauthier-Villars PP - Paris UR - https://www.numdam.org/item/ITA_1974__8_1_37_0/ LA - fr ID - ITA_1974__8_1_37_0 ER -
%0 Journal Article %A Flajolet, Philippe %A Steyaert, Jean-Marc %T Une généralisation de la notion d'ensemble immune %J Revue française d'automatique informatique recherche opérationnelle. Informatique théorique %D 1974 %P 37-48 %V 8 %N R1 %I Dunod-Gauthier-Villars %C Paris %U https://www.numdam.org/item/ITA_1974__8_1_37_0/ %G fr %F ITA_1974__8_1_37_0
Flajolet, Philippe; Steyaert, Jean-Marc. Une généralisation de la notion d'ensemble immune. Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Tome 8 (1974) no. R1, pp. 37-48. https://www.numdam.org/item/ITA_1974__8_1_37_0/
[1] , Theory of Recursive Functions and Effective computability, McGraw Hill (1966). | Zbl | MR
[2] , Some Classes of Recursive Function, Rozprawy Maternatyczne, pp. 1-46 (1953). | Zbl | MR | EuDML
[3] , Recursive Functions, Academic Press (1966). | Zbl | MR
[4] , A machine-Independent Theory of the Complexity of Recursive Functions, JACM, vol. 14, n° 2, Appril (1967), pp. 322-336. | Zbl | MR
[5] et , Generalised Immune Sets, Rapport IRIA (1973).
[6] , Hierarchy Theorems for Axiomatic Complexity, Computational Complexity, pp. 37-63, edited by Randall Rustin-Algorithmics Press Inc (1973).
[7] et , Une Formalisation de la Notion d'Algorithme de Tri non Récurrent. Thèse de 3e cycle, Paris VII (1973).
[8] , The degree hierarchy of undecidable problems of formal grammars, ACM-SIGACT Symposium (1970).
[9] , On Unsolvability in Subrecursive Classes of Predicates, Harvard University report (1972).
[10] et , Computational Complexity and Program Structure, IBM research report RC 1817 (1967).
[11] , On two way Multihead Automata, JCSS 7, 28-36 (1973). | Zbl | MR
[12] , On multihead Finite Automata, IBM Journal (1966), 388-394. | Zbl
[13] et , Decision Problems for Multihead Finite Automata. Proceedings of MFCS Symposium, pp. 225-230 (1973). | MR
[14] et , Economy of Description by Automata, Grammars and Formal Systems. Conference Record (1971). 12tl Annual Sympon Switching an Automata Theory, pp. 188-191.
[15] Program Size, in Restricted Programming Languages, Information and Control, 21, 382-394 (1972). | Zbl | MR






