L'EQUIVALENCE SEMANTIQUE DES SCHEMAS DE PROGRAMME ET SON EXPRESSION SYNTACTIQUE).GUESSARIAN I.1975; C.R. ACAD. SCI., A; FR.; DA. 1975; VOL. 280; NO 21; PP. 1451-1453; ABS. ANGL.; BIBL. 1 REF.Article

PROGRAM SCHEMATA WITH POLYNOMIAL BOUNDED COUNTERS.WEIHRAUCH K.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 3; PP. 91-96; BIBL. 4 REF.Article

DESCRIPTION OF RESTRICTED AUTOMATA BY FIRST-ORDER FORMULAE.LEWIS HR.1975; MATH. SYST. THEORY; U.S.A.; DA. 1975; VOL. 9; NO 2; PP. 97-104; BIBL. 12 REF.Article

RELATIONSHIP BETWEEN MAXIMAL PARALLELISM AND MAXIMAL SIMULTANEITY IN A DIRECTED-GRAPH MODEL OF PARALLEL COMPUTATION. = RELATION ENTRE LE PARALLELISME MAXIMAL ET LA SIMULTANEITE MAXIMALE DANS LE MODELE A GRAPHES DIRIGES DU CALCUL PARALLELEBAIN D.1975; ELECTRON. LETTERS; G.B.; DA. 1975; VOL. 11; NO 25-26; PP. 629-630; BIBL. 6 REF.Article

EFFICIENT COMPILATION OF LINEAR RECURSIVE PROGRAMS.CHANDRA AK.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 16-25; BIBL. 12 REF.Conference Paper

EQUIVALENCE SEMANTIQUE DES SCHEMAS DE PROGRAMME ET SON EXPRESSION SYNTACTIQUE.GUESSARIAN I.sdIN: THEOR. ALGORITHMES LANG. PROGRAMMATION. SEMIN.; ROCQUENCOURT; 1974-1975; ROCQUENCOURT; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 29-32; ABS. ANGL.; BIBL. 1 REF.Conference Paper

ETUDE DE L'EQUIVALENCE DES SCHEMAS DE PROGRAMMES PAR LES MOYENS DE LA THEORIE DES SCHEMAS FONCTIONNELSFAL'K VN.1982; PROGRAMMIROVANIE; SUN; DA. 1982; NO 1; PP. 20-26; BIBL. 7 REF.Article

NATURAL PROPERTIES OF FLOWCHART STEP-COUNTING MEASURES.BAKER TP.1978; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1978; VOL. 16; NO 1; PP. 1-22; BIBL. 11 REF.Article

TRANSFORMATIONS EQUIVALENTS DES SCHEMAS A STRUCTURE LOGIQUE REPRESENTES DANS LE LANGAGE DES K-LISTESPONOMARENKO GG; CHUBERKIS VP.1976; UPRAVL. SIST. MACH., U.S.S.R.; S.S.S.R.; DA. 1976; NO 2; PP. 75-78; BIBL. 7 REF.Article

SIMPLE PROGRAM SCHEMES AND FORMAL LANGUAGES.ENGELFRIET J.1974; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1974; VOL. 20; PP. (260P.); BIBL. 6 P. 1/2Article

CONTROL STRUCTURE ABSTRACTIONS OF THE BACKTRACKING PROGRAMMING TECHNIQUE.GERHART SL; YELOWITZ L.1976; I.E.E.E. TRANS. SOFTWARE ENGNG; U.S.A.; DA. 1976; VOL. 2; NO 4; PP. 285-292; BIBL. 17 REF.Article

A COMPLETENESS THEOREM FOR STRAIGHT-LINE PROGRAMS WITH STRUCTURED VARIABLES.HOFFMANN CM; LANDWEBER LH.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 203-220; BIBL. 14 REF.Article

DECIDING FREENESS FOR PROGRAM SCHEMES WITH A SINGLE UNARY FUNCTIONTAT HUNG CHAN.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 3; PP. 98-102; BIBL. 3 REF.Article

GERARCHIE E PROBLEMI DI DECISIONE PER FUNZIONI DI SEQUENZA = HIERARCHIE DE FONCTIONS DE SEQUENCE ET PROBLEMES DE DECISIONFACHINI E.1981; RIV. INFORM.; ISSN 0390-668X; ITA; DA. 1981; VOL. 11; NO 3; SUPPL.; PP. 41-47; BIBL. 6 REF.Article

LOGIQUES A PROGRAMMESPLYUSHKYAVICHYUS RA; PLYUSHKYAVICHENE A YU; SAKALAUSKAJTE YU V et al.1979; KIBERNETIKA; UKR; DA. 1979; NO 2; PP. 12-19; ABS. ENG; BIBL. 31 REF.Article

ON THE COMPLETENESS OF THE INDUCTIVE ASSERTION METHOD.DE BAKKER JW; MEERTENS LGLT.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 3; PP. 323-357; BIBL. 19 REF.Article

ON THE TERMINATION OF PROGRAM SCHEMAS.KFOURY AJ; PARK DMR.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 29; NO 3; PP. 243-251; BIBL. 5 REF.Article

LES GRAPHES FONCTIONNELS EN TANT QUE MODELE MATHEMATIQUE DE CALCULGRABSKA E.1975; PODSTAWY STEROWAN.; POLSKA; DA. 1975; VOL. 5; NO 4; PP. 375-382; ABS. ANGL. RUSSE; BIBL. 5 REF.Article

PROGRAM SCHEMAS WITH EQUALITYCHANDRA AK; ZOHAR MANNA.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 52-64; BIBL. 16 REF.Conference Paper

COMPLEXITY IN PROGRAM SCHEMES: THE CHARACTERISTIC POLYNOMIALCANTONE G; CIMITILE A; SANSONE L et al.1983; SIGPLAN NOTICES; ISSN 0362-1340; USA; DA. 1983; VOL. 18; NO 3; PP. 22-31; BIBL. 8 REF.Article

FUNDAMENTAL PROPERTIES OF INFINITE TREESCOURCELLE B.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 25; NO 2; PP. 95-169; BIBL. 70 REF.Article

ON THE ABILITY OF STRUCTURES TO STORE AND ACCESS INFORMATIONCRITCHER A.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 366-378; BIBL. 7 REF.Conference Paper

SYNTHESE A PLUSIEURS NIVEAUX DES PROGRAMMES STRUCTUREESYUSHCHENKO EL; TSEJTLIN GE.1982; KIBERNETIKA; ISSN 506850; UKR; DA. 1982; NO 5; PP. 11-32; 12 P.; ABS. ENG; BIBL. 86 REF.Article

PROCESSES IN PETRI NETSSTARKE PH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 350-359; BIBL. 7 REF.Conference Paper

PROPOSITIONAL DYNAMIC LOGIC OF LOOPING AND CONVERSESTREETT RS.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 375-383; BIBL. 14 REF.Conference Paper