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

ON A LANGUAGE WITHOUT STARCATTEUX M.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 1; PP. 27-30; BIBL. 9 REF.Article

EXTENSIONS OF SOKOLOWSKI'S THEOREM TO PROVE LANGUAGES ARE NOT CONTEXT FREE OR NOT REGULARGRANT PW.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 3-4; PP. 187-196; BIBL. 2 REF.Article

TEST SETS FOR CONTEXT FREE LANGUAGES AND ALGEBRAIC SYSTEMS OF EQUATIONS OVER A FREE MONOIDALBERT J; CULIK K II; KARHUMAKI J et al.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 2; PP. 172-186; BIBL. 9 REF.Article

COMPUTATION COMPLEXITY OF N-BOUNDED COUNTER AUTOMATON AND MULTIDIMENSIONAL REBOUND AUTOMATONMORITA K; SUGATA K; UMEO H et al.1977; SYST. COMPUTERS CONTROLS; USA; DA. 1977; VOL. 8; NO 2; PP. 80-87; BIBL. 8 REF.Article

THE CLASS OF CONTEXT-FREE LANGUAGES IS NOT AN EOL FAMILY.ALBERT J; MAURER HA.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 6; PP. 190-195; BIBL. 8 REF.Article

ZUR TEILWORTKOMPLEXITAET FUER WOERTER UND FOLGEN UEBER EINEN ENDLICHEN ALPHABET = SUR LA COMPLEXITE DES SOUS-MOTS POUR DES MOTS ET DES SUITES SUR UN ALPHABET FINIHEINZ M.1977; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1977; VOL. 13; NO 1-2; PP. 27-38; ABS. ANGL. RUSSE; BIBL. 9 REF.Article

CONTEXT-FREE ALGEBRAS.HATCHER WS; RUS T.1976; J. CYBERN.; U.S.A.; DA. 1976; VOL. 6; NO 1-2; PP. 65-77; BIBL. 6 REF.Article

PLANARITE ET ALGEBRICITE.CORI R.1976; ASTERISQUE; FR.; DA. 1976; NO 38-39; PP. 33-44; BIBL. 9 REF.; (JOURN. ALGORITHMIQUES. CONF.; PARIS; 1975)Conference Paper

SUPERSTRUCTURES DES GRAMMAIRES GENERATIVES ET PROPRIETE DE SEMI-LINEARITEKATS BE; SOTSKIJ EH D.1976; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1976; VOL. 12; NO 2; PP. 95-97; BIBL. 7 REF.Article

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