Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

ON INFINITE WORDS OBTAINED BY ITERATING MORPHISMS

Author
CULIK K II; SALOMAA A
UNIV. WATERLOO, DEP. COMPUTER SCI./WATERLOO ON/CAN
Source
THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 29-38; BIBL. 12 REF.
Document type
Article
Language
English
Keyword (fr)
THEORIE LANGAGE DECIDABILITE LANGAGE FORMEL SYSTEME DOL SYSTEME DTOL MOT INFINI INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
LANGUAGE THEORY DECIDABILITY FORMAL LANGUAGE 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
PASCAL83X0056135

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