UN ANALYSEUR SYNTAXIQUE POUR GRAMMAIRES HORS CONTEXTE ASCENDANT SELECTIF ET GENERALCOUSOT P.1972; IN: TECH. INF. CONGR. AFCET. GRENOBLE, 1972; PARIS; AFCET; DA. 1972; VOL. 1; PP. 391-405; BIBL. 1 P.Conference Paper

GRAMMATICHE CONTEXT-FREE SU SPAZI METRICI COMPATTI. = GRAMMAIRES INDEPENDANTES DU CONTEXTE SUR DES ESPACES METRIQUES COMPACTSBERTONI A.1974; CALCOLO; ITAL.; DA. 1974; VOL. 11; NO 1; PP. 155-170; ABS. ANGL.; BIBL. 5 REF.Article

ON STRONGLY EQUIVALENT CONTEXT-FREE GRAMMAR FORMS.GINSBURG S; MAURER HA.1976; COMPUTING; AUSTR.; DA. 1976; VOL. 16; NO 3; PP. 281-290; ABS. ALLEM.; BIBL. 1 REF.Article

ON DERIVATION LANGUAGES CORRESPONDING TO CONTEXT-FREE GRAMMAES.PENTTONEN M.1974; ACTA INFORMAT.; ALLEM.; DA. 1974; VOL. 3; NO 3; PP. 285-291; BIBL. 4 REF.Article

SYSTEMES D'EQUATIONS DANS UN ESPACE DE LANGAGES AVEC APPLICATIONS AUX GRAMMAIRES CFBORCAN G.1975; STUD. CERC. MAT.; ROMAN.; DA. 1975; VOL. 27; NO 3; PP. 267-279; ABS. ANGL.; BIBL. 4 REF.Article

CONTEXT-LIMITED GRAMMARS.HIBBARD TN.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 446-453; BIBL. 12 REF.Article

EQUIVALENZA TRA GRAMMATICHE, SISTEMI DI EQUAZIONI IN VARIABILI DI LINGUAGGIO E SERIE FORMALI. = EQUIVALENCE ENTRE GRAMMAIRES, SYSTEMES D'EQUATIONS EN VARIABLES DE LANGAGES ET SERIES FORMELLESGATTO M; MANDRIOLI D.1974; CALCOLO; ITAL.; DA. 1974; VOL. 11; NO 1; PP. 97-109; ABS. ANGL.; BIBL. 7 REF.Article

N-RECONSTRUCTABILITY OF CONTEXT-FREE GRAMMARS.MANDRIOLI D.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 2; PP. 58-62; BIBL. 5 REF.Article

GRAMMAIRE INDEPENDANTE DU CONTEXTE GENERALISEE DU LANGAGE ALGORITHMIQUE ALGOL 68BUBLIK VV.1975; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1975; NO 6; PP. 7-14; ABS. ANGL.; BIBL. 10 REF.Article

ON BOUNDED RIGHT CONTEXT LANGUAGES AND GRAMMARS.GRAHAM SL.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 3; PP. 224-254; BIBL. 10 REF.Article

A NOTE ON THE AMBIGUITY OF CONTEXT-FREE GRAMMARS.TAKAOKA T.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 2; PP. 35-36; BIBL. 4 REF.Article

AN ANALYSIS OF GRAMMARS BY THEIR DERIVATION SETS.FLECK AC.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 24; NO 4; PP. 389-398; BIBL. 13 REF.Article

SUR UNE CLASSE DE GRAMMAIRES ADMETTANT UNE ANALYSE NON RECURRENTE PAR LA METHODE DE UNGERGRAFEEVA NG.1981; PROGRAMMIROVANIE; SUN; DA. 1981; NO 2; PP. 28-33; BIBL. 6 REF.Article

GRAMMATICAL INFERENCE: INTRODUCTION AND SURVEY. I. = INFERENCE GRAMMATICALE: INTRODUCTION ET SYNTHESE. IKING SUN FU; BOOTH TL.1975; I.E.E.E. TRANS. SYST. MAN CYBERN.; U.S.A.; DA. 1975; VOL. 5; NO 1; PP. 95-111; BIBL. 50 REF.Article

LL (1) GRAMMARS SUPPORTING AN EFFICIENT ERROR HANDLING.GHEZZI C.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 6; PP. 174-176; BIBL. 8 REF.Article

ON THE AMBIGUITY FUNCTION OF CONTEXT-FREE LANGUAGES.TAKAOKA T; AMAMIYA M.1975; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1975; VOL. 6; NO 1; PP. 31-35; BIBL. 7 REF.Article

THEORY OF COMPUTING.1975; IN: 8TH HAWAII INT. CONF. SYST. SCI. PROC.; HONOLULU; 1975; NORTH HOLLYWOOD; WESTERN PERIODICALS CO.; DA. 1975; PP. 1-18; BIBL. DISSEM.Conference Paper

LL-REGULAR GRAMMARS.JARZABEK S; KRAWCZYK T.1974; PRACE INST. MASZ. MAT.; POLSKA; DA. 1974; VOL. 16; NO 1; PP. 95-107; ABS. POL. RUSSE; BIBL. 7 REF.Article

ASSOCIATE LANGUAGES AND DERIVATIONAL COMPLEXITY OF FORMAL GRAMMARS AND LANGUAGESMORIYA E.1973; INFORM. AND CONTROL; U.S.A.; DA. 1973; VOL. 22; NO 2; PP. 139-162; BIBL. 1 P. 1/2Serial Issue

DIRECT PROOFS OF THE UNDECIDABILITY OF THE EQUIVALENCE PROBLEM FOR SENTENTIAL FORMS OF LINEAR CONTEXT-FREE GRAMMARS AND THE EQUIVALENCE PROBLEM FOR OL SYSTEMSROZENBERG G.1972; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1972; VOL. 1; NO 6; PP. 233-235; BIBL. 6 REF.Serial Issue

COVERING-LANGUAGES OF GRAMMARSKASAI T.1971; PROC. JAP. ACAD.; JAP.; DA. 1971; VOL. 47; NO 2 SUPPL; PP. 1025-1029; BIBL. 5 REF.Serial Issue

FORMAL TRANSLATIONS AND SZILARD LANGUAGES.KRIEGEL HP; MAURER HA.1976; INFORM. AND CONTROL.; U.S.A.; DA. 1976; VOL. 30; NO 2; PP. 187-198; BIBL. 6 REF.Article

GRAMMATICAL INFERENCE BY HILL CLIMBING.COOK CM; ROSENFELD A; ARONSON AR et al.1976; INFORM. SCI.; U.S.A.; DA. 1976; VOL. 10; NO 1; PP. 59-80; BIBL. 11 REF.Article

ON THE COMPLETE COVERING PROBLEM FOR LR(K) GRAMMARS.MICKUNAS MD.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 17-30; BIBL. 9 REF.Article

Page / 30