Pascal and Francis Bibliographic Databases

Help

Permanent link : http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=PASCAL8130309659

Export

Selection :

A THEORY OF COMPLEXITY OF MONADIC RECURSION SCHEMES

Author
DIKOVSKII AJ
BUL'VAR GUSEVA 30/KALININ 170043/SUN
Source
R.A.I.R.O.; ISSN 0399-0540; FRA; DA. 1981; VOL. 15; NO 1; PP. 67-94; ABS. FRE; BIBL. 14 REF.
Document type
Article
Language
English
Keyword (fr)
SCHEMA PROGRAMME COMPLEXITE CALCUL MESURE COMPLEXITE CALCULABILITE GRAMMAIRE CF SCHEMA RECURSIF SCHEMA MONADIQUE INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
PROGRAM SCHEMATE COMPUTING COMPLEXITY COMPLEXITY MEASUREMENT CALCULABILITY CONTEXT FREE GRAMMAR COMPUTER SCIENCES APPLIED MATHEMATICS
Keyword (es)
INFORMATICA MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL8130309659

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web