BOUNDED NESTING IN MACRO GRAMMARSENGELFRIET J; SLUTZKI G.1979; INFIRM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 2; PP. 157-193; BIBL. 1 P.Article

CONTEXT-FREE LANGUAGES OF FINITE WORDS AS LEAST FIXPOINTSPOIGNE A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 301-320; BIBL. 7 REF.Conference Paper

ON A SPECIAL MONOID WITH A SINGLE DEFINING RELATIONJANTZEN M.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 1; PP. 61-73; BIBL. 6 REF.Article

CONTROL SETS ON GRAMMARS USING DEPTH-FIRST DERIVATIONSLUKER M.1980; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1980; VOL. 13; NO 4; PP. 349-359; BIBL. 19 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

LOCAL CONTRAINTS IN PROGRAMMING LANGUAGES. I: SYNTAXJOSHI AK; LEVY LS; YUEH K et al.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 265-290; BIBL. 15 REF.Article

ON THE SUCCINTNESS OF DIFFERENT REPRESENTATIONS OF LANGUAGESHARTMANIS J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 282-288; BIBL. 6 REF.Conference Paper

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

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

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

TABLE SYSTEMS WITH UNCONDITIONAL TRANSFERROZENBERG G; SALOMAA A.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 4; PP. 319-322; 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

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

A NOTE ON THE DENSITY OF INHERENTLY AMBIGUOUS CONTEXT-FREE LANGUAGESKEMP R.1980; ACTA INF.; ISSN 0001-5903; DEU; DA. 1980; VOL. 14; NO 3; PP. 295-298; BIBL. 6 REF.Article

CONTEXT-FREE AND STATIONARY LANGUAGESTHIERRIN G.1979; INTERNATION. J. COMPUTER MATH.; USA; DA. 1979; VOL. 7; NO 4; PP. 297-301; BIBL. 4 REF.Article

A HOMOMORPHIC CHARACTERIZATION OF INDEXED LANGUAGESDUSKE J; PARCHMAN R; SPECHT J et al.1979; ELEKTRON. INFORM.-VERARBEIT KYBERN.; DDR; DA. 1979; VOL. 15; NO 4; PP. 187-195; ABS. RUS/GER; BIBL. 3 REF.Article

A METHOD FOR PROVING PROGRAMMING LANGUAGES NON CONTEXT-FREE.SOKOLOWSKI S.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 3; PP. 151-153; BIBL. 3 REF.Article

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

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

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

ON SIMPLE REPRESENTATIONS OF LANGUAGE FAMILIESCULIK K II; MAURER HA.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 241-250; ABS. FRE; BIBL. 14 REF.Article