Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("THEORIE LANGAGE")

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

Results 1 to 25 of 2923

  • Page / 117

Export

Selection :

  • and

THE HALTING PROBLEM FOR LINEAR TURING ASSEMBLERS.BAER RM; VAN LEEUWEN J.1975; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1975; NO 42; PP. 1-26; BIBL. 10 REF.Article

ITERATIVE ALGEBRASNELSON E.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 25; NO 1; PP. 67-94; BIBL. 6 REF.Article

ON SOME CLASSES OF GRAMMARS WITH RESTRICTIONS IN DERIVATIONPAUN G.1981; MATH., MATH.; ROM; DA. 1981; VOL. 23; NO 1; PP. 55-60; BIBL. 13 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

A SYSTEMATIC TEST FOR EXTENDED OPERATOR PRECEDENCEWILLIAMS MH.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 187-190; BIBL. 3 REF.Article

AIR OGDEN-LIKE ITERACTION LEMMA FOR NATIONAL POWER SERIESREUTENAUER C.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 2; PP. 189-197; BIBL. 8 REF.Article

ON THE HOLONOMY DECOMPOSITION OF TRANSFORMATION SEMIGROUPSHOLCOMBE M.1982; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 99-104; BIBL. 1 REF.Article

STRONG NONCOMPUTABILITY OF RANDOM STRINGSCALUDE C; CHITESCU I.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 1; PP. 43-45; BIBL. 6 REF.Article

DESCRIPTION D'UNE CLASSE DE GRAMMAIRES DE GRAPHES SANS CIRCUITCORI M.1982; R.A.I.R.O. INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 1; PP. 33-49; ABS. ENG; BIBL. 11 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

AN EXTENSION OF TREE ADJUNCT GRAMMARSUPTON RA.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 51; NO 3; PP. 248-274; BIBL. 15 REF.Article

NOTE MINIMAL COMPLETE SETS OF WORDSBOE JM; DE LUCA A; RESTIVO A et al.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 325-332; BIBL. 5 REF.Article

ON SEQUENTIAL AND PARALLEL-NODE-REWRITING GRAPH GRAMMARSJANSSENS D; ROZENBERG G; VERRAEDT R et al.1982; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1982; VOL. 18; NO 3; PP. 219-304; BIBL. 10 REF.Article

REWRITING SYSTEMS WITH LIMITED DISTANCE FORBIDDING CONTEXTVON SOLMS SH.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 3-4; PP. 227-239; BIBL. 5 REF.Article

ON THE INTERPOLATION OF DOL-SEQUENCESPRODINGER H.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 107-108; BIBL. 9 REF.Article

ON A GENERALIZATION OF THE DYCK-LANGUAGE OVER A TWO LETTER ALPHABETPRODINGER H.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 3; PP. 269-276; BIBL. 6 REF.Article

RECENT ADVANCES IN SYNTACTIC PATTERN RECOGNITIONFU KS.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 13-18; BIBL. 56 REF.Conference Paper

VERALLGEMEINERTE KOMMUTATIVE SPRACHEN = LANGAGES COMMUTATIFS GENERALISESKEKLIKOGLOU I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 70-75; ABS. ENG; BIBL. 8 REF.Conference Paper

A GENERAL FRAMEWORK FOR COMPARING SEQUENTIAL AND PARALLEL REWRITINGKLEIJN HCM; ROZENBERG G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 360-368; BIBL. 8 REF.Conference Paper

INFINITE 0-1-SEQUENCES WITHOUT LONG ADJACENT IDENTICAL BLOCKSPRODINGER H; URBANEK FJ.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 3; PP. 277-289; BIBL. 12 REF.Article

ON SOME DECIDABILITY PROBLEMS FOR HDOL SYSTEMS WITH NONSINGULAR PARIKH MATRICESRUOHONEN K.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 3; PP. 377-384; BIBL. 10 REF.Article

ON LANGUAGES SATISFYING OGDEN'S LEMMABOASSON L; HORVATH S.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 3; PP. 201-202; BIBL. 7 REF.Article

ON THE SUBWORD COMPLEXITY OF DOL LANGUAGES WITH A CONSTANT DISTRIBUTIONEHRENFEUCHT A; ROZENBERG G.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 3; PP. 108-113; BIBL. 8 REF.Article

LES ORDRES DE DECOMPOSITION: UN OUTIL INCREMENTAL POUR PROUVER LA TERMINAISON FINIE DE SYSTEMES DE REECRITURE DE TERMES = ORDERS OF DECOMPOSITION: AN INCREMENTAL TOOL TO PROVE THE FINITE TERMINATION OF SYSTEM FOR THE REWRITING OF TERMSREINIG FERNAND.1981; ; FRA; DA. 1981; 107 P.; 21 CM; BIBL. 3 P.; TH. 3E CYCLE: INFORM./NANCY 1/1981/164Thesis

  • Page / 117