ON THE REGULARITY PROBLEM OF SF-LANGUAGES GENERATED BY MINIMAL LINEAR GRAMMARSLINNA M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 244-249; BIBL. 4 REF.Conference Paper

DIFFERENTS TYPES DE DERIVATIONS INFINIES DANS LES GRAMMAIRES ALGEBRIQUES D'ARBRESPOLIAN N.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 340-349; BIBL. 8 REF.Conference Paper

ON THE GENERATIVE CAPACITY OF CONDITIONAL GRAMMARSPAUN G.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 2; PP. 178-186; BIBL. 6 REF.Article

DIE VERWANDTSCHAFT KONTEXTFREIER GRAMMATIKEN = SUR LES RELATIONS ENTRE GRAMMAIRES CFWALTER HKG.1979; COMPUTING; AUT; DA. 1979; VOL. 22; NO 1; PP. 31-58; ABS. ENG; BIBL. 17 REF.Article

LR-PARSING OF EXTENDED CONTEXT FREE GRAMMARS.MADSEN OL; KRISTENSEN BB.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 7; NO 1; PP. 61-73; BIBL. 7 REF.Article

CONTEXT-FREE GRAPH GRAMMARS.DELLA VIGNA P; GHEZZI C.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 37; NO 2; PP. 207-233; BIBL. 10 REF.Article

ON THE INDEX OF GRAMMARS AND LANGUAGES.PAUN G.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 35; NO 4; PP. 259-266; BIBL. 7 REF.Article

GRAPH GRAMMARS WITH NEIGHBOURHOOD-CONTROLLED EMBEDDINGJANSSENS D; ROZENBERG G.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 1; PP. 55-74; BIBL. 9 REF.Article

AN ISOMETRIC CONTEXT-FREE ARRAY GRAMMAR THAT GENERATES RECTANGLESYAMAMOTO Y; MORITA K; SUGATA K et al.1982; TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS OF JAPAN. SECTION E; ISSN 0387-236X; JPN; DA. 1982; VOL. 65; NO 12; PP. 754-755; BIBL. 4 REF.Article

NODE-LABEL CONTROLLED GRAPH GRAMMARS (EXTENDED ABSTRACT)JANSSENS D; ROZENBERG G.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 334-347; BIBL. 17 REF.Conference Paper

HEXAGONAL ARRAY GRAMMARSSUBRAMANIAN KG.1979; COMPUTER GRAPH IMAGE PROCESSG; USA; DA. 1979; VOL. 10; NO 4; PP. 388-394; BIBL. 3 REF.Article

NOTES ON CANONICAL LABEL LANGUAGESCANNON RL JR.1979; INTERNATION. J. COMPUTER INFORM. SCI.; USA; DA. 1979; VOL. 8; NO 2; PP. 141-148; BIBL. 13 REF.Article

ON DIRECTLY CONSTRUCTING LR(K) PARSERS WITHOUT CHAIN REDACTIONS.LALONDE WR.1976; IN: CONF. REC. ACM SYMP. PRINC. PROGRAM. LANG. 3. SYMP.; ATLANTA, GA.; 1976; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1976; PP. 127-133; BIBL. 17 REF.Conference Paper

PARALLEL CONTEXT-FREE ARRAY GRAMMAR NORMAL FORMSSHEN PEI WANG P.1981; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1981; VOL. 15; NO 3; PP. 296-300; BIBL. 14 REF.Article

SPACE-RESTRICTED ATTRIBUTE GRAMMARSSCHMIDT EM.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 436-448; BIBL. 6 REF.Conference Paper

ON LABELLED GRAPH GRAMMARS.LEVY LS; KANG YUEH.1978; COMPUTING; AUSTR.; DA. 1978; VOL. 20; NO 12; PP. 109-125; ABS. ALLEM.; BIBL. 10 REF.Article

ON THE COMPLEXITY OF FORMAL GRAMMARS.BOOK RV.1978; ACTA INFORMAT.; ALLEM.; DA. 1978; VOL. 9; NO 2; PP. 171-181; BIBL. 20 REF.Article

SUR LES ENSEMBLES DE MOTS INFINIS ENGENDRES PAR UNE GRAMMAIRE ALGEBRIQUE.NIVAT M.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT. RAPP. RECH.; FR.; DA. 1978; NO 290; PP. 1-23; ABS. ANGL.; BIBL. 4 REF.Serial Issue

THE DECIDABILITY OF EQUIVALENCE FOR A FAMILY OF LINEAR GRAMMARSYEHUDAI A.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 47; NO 2; PP. 122-136; BIBL. 25 REF.Article

COMPARISON OF SOME METHODS FOR THE DEFINITION OF STATIC SEMANTICSFARKAS E.1979; C.L. AND C.L.; HUN; DA. 1979; VOL. 13; PP. 7-18; BIBL. 14 REF.Article

TOPOLOGICAL CHARACTERIZATION OF FAMILIES OF GRAPHS GENERATED BY CERTAIN TYPES OF GRAPH GRAMMARSYANNAKAKIS M; PAVLIDIS T.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 1; PP. 72-86; BIBL. 13 REF.Article

PLAN2D. SYNTACTIC ANALYSIS OF PRECEDENCE GRAPH GRAMMARS.FRANCK R.1976; IN: CONF. REC. ACM SYMP. PRINC. PROGRAM. LANG. 3. SYMP.; ATLANTA, GA.; 1976; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1976; PP. 134-139; BIBL. 6 REF.Conference Paper

TRANSFORMING LR(K) GRAMMARS TO LR(1), SLR(1), AND (1,1) BOUNDED RIGHT-CONTEXT GRAMMARS.MICKUNAS MD; LANCASTER RL; SCHNEIDER VB et al.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 511-533; BIBL. 25 REF.Article

HYPERGRAPH SYSTEMS AND THEIR EXTENSIONSJANSSENS D; ROZENBERG G.1983; R.A.I.R.O. INFORMATIQUE THEORIQUE; ISSN 0399-0540; FRA; DA. 1983; VOL. 17; NO 2; PP. 163-196; ABS. FRE; BIBL. 4 REF.Article

ON THE GENERATIVE CAPACITY OF COMPOUND STRING AND ARRAY GRAMMARSSUBRAMANIAN KG; RANI SIROMONEY.1982; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 26; NO 3; PP. 231-241; BIBL. 17 REF.Article