Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("CONTEXT FREE GRAMMAR")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1021

  • Page / 41

Export

Selection :

  • and

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

ON THE HOTZ GROUP OF A CONTEXT-FREE GRAMMARFROUGNY C; SAKAROVITCH J; VALKEMA E et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 1; PP. 109-115; BIBL. 13 REF.Article

PREDICTORS OF CONTEXT-FREE GRAMMARSKUO CHUNG TAI.1979; CONFERENCE INFORMATION SCIENCES AND SYSTEMS/1979-03-28/BALTIMORE MD; USA; BALTIMORE: THE JOHNS HOPKINS UNIVERSITY; DA. 1979; PP. 532-537; BIBL. 13 REF.Conference Paper

THE DECIDABILITY OF THE EQUIVALENCE OF CONTEXT-FREE GRAMMAR FORMSBLATTNER M.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1973/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 91-96; BIBL. 8 REF.Conference Paper

THE NONEXISTENCE OF SOME COVERING CONTEXT-FREE GRAMMARSUKKONEN E.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 187-192; BIBL. 6 REF.Article

VERIFICAREA CONDITIEI LL(1) PENTRU GRAMATICI INDEPENDENTE DE CONTEXT = TEST DE LA CONDITION LL(1) POUR LES GRAMMAIRES CONTEXT FREEKALISZ E.1979; BUL. INST. POLITEH. "GHEORGHE GHEORGHIU-DEJ" BUCURESTI, ELECTROTEH.; ROM; DA. 1979; VOL. 41; NO 1; PP. 105-112; ABS. ENG; BIBL. 3 REF.Article

A MODIFICATION OF THE LR (K) METHOD FOR CONSTRUCTING COMPACT BOTTOM-UP PARSERSUKKONEN E.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 646-658; BIBL. 12 REF.Conference Paper

DERIVATION COMPLEXITY IN CONTEXT-FREE GRAMMAR FORMS.GINSBURG S; LYNCH N.1977; S.I.A.M. J. COMPTG; U.S.A.; DA. 1977; VOL. 6; NO 1; PP. 123-138; BIBL. 9 REF.Article

THE DERIVATION DIAGRAM OF A WEB GRAMMAR AND ITS APPLICATION TO SCENE ANALYSIS.BRAYER JM; FU KS.1976; IN: JT. WORKSHOP PATTERN RECOGNITION ARTIF. INTELL. CONF. REC.; HYANNIS, MASS.; 1976; NEW YORK; I.E.E.E.; DA. 1976; PP. 43-50; BIBL. 10 REF.Conference Paper

LEFT UNIVERSAL CONTEXT-FREE GRAMMARS AND HOMOMORPHIC CHARACTERIZATIONS OF LANGUAGESHIROSE S; NASU M.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 50; NO 2; PP. 110-118; BIBL. 11 REF.Article

ON THE GENERATIVE CAPACITY OF SOME CLASSES OF GRAMMARS WITH REGULATED REWRITINGPAUN G.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 407-414; BIBL. 9 REF.Conference Paper

SOME FURTHER REMARKS ON THE FAMILY OF FINITE INDEX MATRIX LANGUAGESPAUN G.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 289-297; ABS. FRE; BIBL. 12 REF.Article

PROGRAMME D'ANALYSEUR SYNTAXIQUE POUR LES GRAMMAIRES CF ARBITRAIRESZAJTMAN GA; KHOLODENKO OA.1978; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1978; NO 1; PP. 36-39; ABS. ANGL.; BIBL. 5 REF.Article

TREE CONTROLLED GRAMMARS.CULIK K II; MAURER HA.1977; COMPUTING; AUSTR.; DA. 1977; VOL. 19; NO 2; PP. 129-139; BIBL. 7 REF.Article

EXTENSION D'UNE CLASSE DE SLR(1)-GRAMMAIRESASRATYAN R EH.1977; PROGRAMMIROVANIE; S.S.S.R.; DA. 1977; NO 6; PP. 3-5; BIBL. 2 REF.Article

CONCERNING BOUNDED-RIGHT-CONTEXT GRAMMARS.SZYMANSKI TG.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 273-282; BIBL. 8 REF.Article

ON A COVERING RELATION FOR CONTEXT-FREE GRAMMARSSOISALON SOININEN E; WOOD D.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 4; PP. 435-449; BIBL. 9 REF.Article

CYCLE-FREE N-ALGEBRAIC SYSTEMSKUICH W.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 5-12; BIBL. 3 REF.Conference Paper

AN APPLICATION OF ARRAY GRAMMARS TO CLUSTERING ANALYSISSHEN PEI WANG P.1981; CONFERENCE ON PATTERN RECOGNITION AND IMAGE PROCESSING/1981/DALLAS TX; USA; NEW YORK: IEEE; DA. 1981; PP. 27-30; BIBL. 11 REF.Conference Paper

ON BASIC PROPERTIES OF DOS SYSTEMS AND LANGUAGESEHRENFEUCHT A; ROZENBERG G.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 47; NO 2; PP. 137-153; BIBL. 9 REF.Article

ON CONSTRUCTING LL (K) PARSERSSIPPU S; SOISALON SOININEN E.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 585-595; BIBL. 12 REF.Conference Paper

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

DEUX CLASSES DE GRAMMAIRES DE PRECEDENCE NON CONTRACTANTESBABINOV YU P.1976; ZH. VYCHISLIT. MAT. MAT. FIZ.; S.S.S.R.; DA. 1976; VOL. 16; NO 4; PP. 1027-1037; BIBL. 9 REF.Article

A DIVIDE-AND-CONQUER APPROACH TO GENERAL CONTEXT-FREE PARSINGBOSSI A; COCCO N; COLUSSI L et al.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 203-208; BIBL. 5 REF.Article

  • Page / 41