ON THE RECURSION-THEORETIC COMPLEXITY OF RELATIVE SUCCINCTNESS OF REPRESENTATIONS OF LANGUAGESHAY L.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 2-7; BIBL. 5 REF.Article

MORE ABOUT THE "GEOGRAPHY" OF CONTEXT-FREE LANGUAGESBEAUQUIER J; BERSTEL J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 183-192; BIBL. 15 REF.Conference Paper

ON SOME BOUNDED SEMI AFLS AND AFLSTURAKAINEN P.1981; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1981; VOL. 23; NO 1; PP. 31-48; BIBL. 24 REF.Article

PARTIAL NON-UNDERFLOW AND NON-OVERFLOW OF AN ARITHMETIC STACKGOODWIN DT.1980; COMPUTER J.; GBR; DA. 1980; VOL. 23; NO 2; PP. 153-160; BIBL. 2 REF.Article

ON THE PROOF OF A THEOREM BY CHOMSKY-HOPCROFT-ULLMANOEMRAWSINGH H; OLLONGREN A.1979; INTERNATION. J. COMPUTER MATH.; USA; DA. 1979; VOL. 7; NO 1; PP. 37-41; BIBL. 1 REF.Article

A HOMOMORPHIC REPRESENTATION OF SIMPLE MATRIX LANGUAGES.PASCU A; PAUN G.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 35; NO 4; PP. 267-275; BIBL. 5 REF.Article

GENERATEURS ALGEBRIQUES NON-AMBIGUS.BEAUQUIER J.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 66-73; BIBL. 6 REF.Conference Paper

CONDITIONS ENFORCING REGULARITY OF CONTEXT-FREE LANGUAGESEHRENFEUCHT A; HAUSSLER D; ROZENBERG G et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 187-191; BIBL. 16 REF.Conference Paper

SOME APPLICATIONS OF CFL'S OVER INFINITE ALPHABETSBOASSON L.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 146-151; ABS. ENG; BIBL. 9 REF.Conference Paper

A TRANSLATIONAL THEOREM FOR THE CLASS OF EOL LANGUAGESENGELFRIET J; ROZENBERG G.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 50; NO 2; PP. 175-183; BIBL. 10 REF.Article

EINE NEUE INVARIANTE FUER KONTEXTFREIE SPRACHEN = UN NOUVEL INVARIANT POUR LES LANGAGES "CONTEXT FREE"HOTZ G.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 1; PP. 107-116; ABS. ENG; BIBL. 7 REF.Article

LANGAGES CYCLIQUESSAMOJLENKO LG; SAMOILENKO LG.1980; KIBERNETIKA; UKR; DA. 1980; NO 6; PP. 121-123; ABS. ENG; BIBL. 4 REF.Article

ON THE CIRCULAR CLOSURE OF LANGUAGESDASSOV J.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 1-2; PP. 87-94; ABS. GER/RUS; BIBL. 14 REF.Article

A CHARACTERIZATION OF CONTEXT-FREE LANGUAGESDE GALLEGO MS.1979; ANN. SOC. SCI. BRUXELLES; BEL; DA. 1979; VOL. 93; NO 3; PP. 155-158; BIBL. 3 REF.Article

LONG SPACE RECOGNITION AND TRANSLATION OF PARENTHESIS LANGUAGES.LYNCH N.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 4; PP. 583-590; BIBL. 15 REF.Article

MONOIDES SYNTACTIQUES DES LANGAGES ALGEBRIQUES.PERROT JF.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 7; NO 4; PP. 399-413; ABS. ANGL.; BIBL. 1 P.Article

INDUCTIVE DOMAINS AND ALGEBRAIC SEMANTICS OF CF LANGUAGECOMER SD.1982; COMPUT. LINGUIST. COMPUT. LANG.; ISSN 0324-2048; HUN; DA. 1982; VOL. 15; PP. 43-43; BIBL. 3 REF.Article

A GENERALIZATION OF OGDEN'S LEMMABADER C; MOURA A.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 2; PP. 404-407; BIBL. 4 REF.Article

A NOTE ON REBOUND AUTOMATAINOUE K; TAKANAMI I; TANIGUCHI H et al.1982; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 26; NO 1; PP. 87-93; BIBL. 4 REF.Article

DEUX FAMILLES DE LANGAGES INCOMPARABLESBEAUQUIER J.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 2; PP. 101-122; ABS. ENG; BIBL. 18 REF.Article

A NOTE ON CONNECTIONS BETWEEN OL-LANGUAGES AND CONTEXT-FREE LANGUAGESPIK J.1979; KYBERNETIKA; CSK; DA. 1979; VOL. 15; NO 2; PP. 136-140; BIBL. 5 REF.Article

REGULARITY-PRESERVING RELATIONS.SEIFERAS JI; MCNAUGHTON R.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 2; PP. 147-154; BIBL. 8 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 FINITE POWER PROPERTY FOR CONTEXT-FREE LANGUAGESHUGHES CE; SELKOW SM.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 1; PP. 111-114; BIBL. 4 REF.Article

PARALLEL SIGMA -ERASING ASSAY ACCEPTORSNAKAMURA A.1980; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1980; VOL. 14; NO 1; PP. 80-86; BIBL. 4 REF.Article