Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FORMAL LANGUAGE")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3826

  • Page / 154

Export

Selection :

  • and

CHEMICAL INFERENCE. I: FORMALIZATION OF THE LANGUAGE OF ORGANIC CHEMISTRY: GENERIC STRUCTURAL FORMULASGORDON JE; BROCKWELL JC.1983; JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES; ISSN 0095-2338; USA; DA. 1983; VOL. 23; NO 3; PP. 117-134; BIBL. 38 REF.Article

LANGAGE FORMALISE DE DESCRIPTION DES OBJETS DANS UN SYSTEME AUTOMATISE DE CONCEPTION DE PROCESSUS TECHNOLOGIQUESTSVETKOV VD; PETROVSKIJ AI; TOLKACHEV AA et al.1981; NAUCNO-TEH. INF.-VSES. INST. NAUCN. TEH. INF., SER. 2; ISSN 0548-0027; SUN; DA. 1981; NO 8; PP. 17-20; ABS. ENG/GER; BIBL. 4 REF.Article

A MORE SATISFACTORY DESCRIPTION OF THE SEMANTICS OF JUSTIFICATIONKEARNS JT.1981; NOTRE DAME J. FORMAL LOGIC; ISSN 0029-4527; USA; DA. 1981; VOL. 22; NO 2; PP. 109-119; BIBL. 3 REF.Article

BASES SEMANTIQUES DES LANGAGES OBJET-CARACTERISTIQUERASKINA AA; SIDOROV IS; SHREIDER YU A et al.1976; NAUCH.-TEKH. INFORM., 2; S.S.S.R.; DA. 1976; NO 5; PP. 18-25; ABS. ANGL.; BIBL. 21 REF.Article

A LOWER BOUND FOR HEILBRONN'S PROBLEMKOMLOS J; PINTZ J; SZEMEREDI E et al.1982; J. LOND. MATH. SOC.; ISSN 0024-6107; GBR; DA. 1982; VOL. 25; NO 1; PP. 13-24; BIBL. 8 REF.Article

ON BLOCK DESIGNS ARISING FROM RANK 3 GRAPHSTONCHEV VD.1981; J. STAT. PLANN. INFERENCE; ISSN 0378-3758; NLD; DA. 1981; VOL. 5; NO 4; PP. 399-403; BIBL. 8 REF.Article

BEMERKUNGEN ZU EINER KLASSE VON DURCH EINDIMENSIONALE ITERATIVE AUTOMATEN AKZEPTREITEN SPRACHEN = REMARQUES SUR UNE CLASSE DE LANGAGES ACCEPTES PAR DES AUTOMATES ITERATIFS UNIDIMENSIONNELSDO LONG VAN; VU DUY MAN.1978; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1978; VOL. 14; NO 10; PP. 507-517; ABS. ENG/RUS; BIBL. 6 REF.Article

PRINCIPES DE BASE D'UN LANGAGE DES CATEGORIES LOGIQUESKOZACHKOV LS.1977; NAUCH.-TEKH. INFORM., 2; S.S.S.R.; DA. 1977; NO 9; PP. 13-28; BIBL. 13 REF.Article

FORMAL LANGUAGES AND ENUMERATION. IIGOLDMAN JR.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 234-241; BIBL. 14 REF.Conference Paper

FORMAL LANGUAGES AND ENUMERATION.GOLDMAN JR.1978; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1978; VOL. 24; NO 3; PP. 318-338; BIBL. 11 REF.Article

SMOOTHSORT'S BEHAVIOR ON PRESORTED SEQUENCESHERTEL S.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 165-170; BIBL. 6 REF.Article

ELIMINATION DES SERVITUDES LINGUISTIQUES.MARTEM'JANOV YS.1977; IN: FRANCHIR BARRIERE LINGUIST. CONGR. EUR. SYST. RESEAUX DOC. 3; LUXEMBOURG; 1973; MUENCHEN; VERLAG DOK.; DA. 1977; VOL. 1; PP. 678-680Conference Paper

STRUCTURE POLYSEMANTIQUE DES LANGUES NATURELLESDYANKOV B.1973; VOPR. FILOS.; S.S.S.R.; DA. 1973; NO 7; PP. 137-144; ABS. ANGL.; BIBL. 20REF.Serial Issue

HOMOTOPY SPHERES IN FORMAL LANGUAGEFARMER FD.1982; STUD. APPL. MATH.; ISSN 0022-2526; USA; DA. 1982; VOL. 66; NO 2; PP. 171-179; BIBL. 5 REF.Article

INFINITARY RELATIONSNIVAT M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 46-75; BIBL. 7 REF.Conference Paper

THE INCLUSION OF DOL IN MULTI-RESETCLERBOUT M; LATTEUX M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 2; PP. 45-47; BIBL. 7 REF.Article

TOPOLOGICAL MODEL THEORYFLUM J; ZIEGLER M.1980; LECTURE NOTES MATH.; DEU; DA. 1980; NO 769; 149 P.; BIBL. 28 REF.Serial Issue

FINITE-CHANGE AUTOMATAVON BRAUNMUEHL B; VERBEEK R.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 91-100; BIBL. 7 REF.Conference Paper

THE SEMIGROUPS OF TOTALLY LINEARLY REALIZABLE AUTOMATAEICHNER L.1979; Z. ANGEW. MATH. MECH.; DDR; DA. 1979; VOL. 59; NO 3; PP. T53-T54; BIBL. 4 REF.Article

ON THE GENERATIVE CAPACITY OF SIMPLE MATRIX GRAMMARS OF FINITE INDEX.PAUN G.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 2; PP. 100-102; BIBL. 5 REF.Article

STABLE STRING LANGUAGES OF LINDENMAYER SYSTEMS.VITANYI PMB; WALKER A.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 37; NO 2; PP. 134-149; BIBL. 18 REF.Article

STRUCTURE SEMANTIQUE D'UNE CLASSE DE VERBES: ANALYSE DES COMPOSANTS DE PHRASEEGOROVA NA.1978; NAUCH.-TECH. INFORM., 2; SUN; DA. 1978; NO 11; PP. 26-29; ABS. ENG/GER; BIBL. 7 REF.Article

POSSIBILITE DE SURMONTER LES BARRIERES LINGUISTIQUES INTRA-EUROPEENNES PAR UN ENSEIGNEMENT D'ORIENTATION LINGUISTIQUE AINSI QUE PAR L'OPTIMISATION DU CHOIX D'UNE LANGUE VEHICULAIRE.FRANK H; BEHRMANN H.1977; IN: FRANCHIR BARRIERE LINGUIST. CONGR. EUR. SYST. RESEAUX DOC. 3; LUXEMBOURG; 1977; MUECHEN; VERLAG DOK.; DA. 1977; PP. 40-62; BIBL. 10 REF.Conference Paper

ON THE RELATIONSHIP BETWEEN PROPAGATING CONTEXT-DEPENDENT LINDENMAYER SYSTEMS AND CELLULAR AUTOMATA SYSTEMSBUTLER JT.1982; INFORMATION SCIENCES (NEW YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 28; NO 1; PP. 63-67; BIBL. 5 REF.Article

ON THE FAITHFUL REGULAR EXTENSIONS OF ITERATIVE ALGEBRASPARISI PRESICCE F.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. 368-374; BIBL. 8 REF.Conference Paper

  • Page / 154