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

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

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

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

MOTS INFINIS DE FIBONACCI ET MORPHISMES ITERESPANSIOT JJ.1983; R.A.I.R.O. INFORMATIQUE THEORIQUE; ISSN 0399-0540; FRA; DA. 1983; VOL. 17; NO 2; PP. 131-135; ABS. ENG; BIBL. 3 REF.Article

CLASSIFYING REGULAR EVENTS IN SYMBOLIC LOGICTHOMAS W.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 3; PP. 360-376; BIBL. 14 REF.Article

BASIC FORMULAS AND LANGUAGES. I: THE THEORYEHRENFEUCHT A; ROZENBERG G; VERRAEDT R et al.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 4; PP. 235-255; BIBL. 8 REF.Article

ON SOME PROPERTIES OF THE SYNTACTIC SEMIGROUP OF A VERY PURE SUBSEMIGROUPDE LUCA A.1980; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1980; VOL. 14; NO 1; PP. 39-56; ABS. FRE; BIBL. 17 REF.Article

ON LANGUAGES SPECIFIED BY RELATIVE ACCEPTANCEBOOK RV; WRATHALL C.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 2; PP. 185-195; BIBL. 25 REF.Article

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

DOL SCHEMES AND THE PERIODICITY OF STRING EMBEDDINGSHEAD T; THIERRIN G; WILKINSON J et al.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 83-89; BIBL. 10 REF.Article

A NOTE ON W-REGULAR LANGUAGESTAKAHASHI M; YAMASAKI H.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 217-225; BIBL. 6 REF.Article

ON COMPLEXITY AND SYNTACTIC INFORMATIONBOEKEE DE; KRAAK RA; BACKER E et al.1982; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1982; VOL. 12; NO 1; PP. 71-79; BIBL. 11 REF.Article

PERMUTATIONS ARE NOT CONTEXT-FREE: AN APPLICATION OF THE INTERCHANGE LEMMAMAIN MG.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 2; PP. 68-71; BIBL. 17 REF.Article

THE (GENERALIZED) POST CORRESPONDANCE PROBLEM WITH LISTS CONSISTING OF TWO WORDS IS DECIDABLEEHRENFEUCHT A; KARHUMAEKI J; ROZENBERG G et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 2; PP. 119-144; BIBL. 14 REF.Article

THE POWER OF THE CHURCH-ROSSER PROPERTY FOR STRING REWRITING SYSTEMSBOOK RV.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 360-368; BIBL. 20 REF.Conference Paper

Page / 77