Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22CONTEXT FREE GRAMMAR%22)

Filter

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

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 116170

  • Page / 4647
Export

Selection :

  • and

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

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

ON THE POWER OF CHAIN RULES IN CONTEXT FREE GRAMMARSBLUM N.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 4; PP. 425-433; BIBL. 2 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

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

CONTEXT-FREE GRAMMARS WITH SELECTIVE REWRITINGROZENBERG G; WOOD D.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 3; PP. 257-268; BIBL. 12 REF.Article

THE STRUCTURE OF CONTEXT-FREE GRAMMATICAL FAMILIES.CREMERS A; GINSBURG S; SPANIER EH et al.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 262-279; BIBL. 7 REF.Article

STATES CAN SOMETIMES DO MORE THAN STACK SYMBOLS IN PDA'S. PRELIMINARY VERSION.PRICE JK; WOTSCHKE D.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 353-362; BIBL. 11 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

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

A GENERAL CLASS OF NONCONTEXT FREE GRAMMARS GENERATING CONTEXT FREE LANGUAGEAGGARWAL SK; HEINEN JA.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 2; PP. 187-194; BIBL. 8 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

A SUPERNORMAL-FORM THEOREM FOR CONTEXT-FREE GRAMMARSMAURER HH; SALOMAA A; WOOD D et al.1983; JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 95-102; BIBL. 12 REF.Article

SOME BASIC PROPERTIES OF K-BOUNDED INTERPRETATIONS OF GRAMMAR FORMSVARJU EC.1982; COMPUT. LINGUIST. COMPUT. LANG.; ISSN 0324-2048; HUN; DA. 1982; VOL. 15; PP. 51-73; BIBL. 4 REF.Article

SUR UNE METHODE DE DESCRIPTION DES CONDITIONS CONTEXTUELLESZAJTMAN GA; KHOLODENKO OA.1980; KIBERNETIKA; UKR; DA. 1980; NO 2; PP. 138-139; ABS. ENG; BIBL. 4 REF.Article

QUANTITATIVE ASPEKTE BEI ABLEITUNGSBAEUMEN = LES ASPECTS QUANTITATIFS DES ARBRES DE DERIVATIONKUICH W.1980; WISSENSCHAFTL. Z. TECH. UNIV. DRESD.; ISSN 0043-6925; DDR; DA. 1980; VOL. 29; NO 2; PP. 370-375; BIBL. 10 REF.Article

CLASSIFICATION DES GRAMMAIRES INDEPENDANTES DU CONTEXTE EN FONCTION DE LA COMPLEXITE DE L'ANALYSE GRAMMATICALEKRYUCHKOVA EN.1978; PROGRAMMIROVANIE; SUN; DA. 1978; NO 4; PP. 23-32; BIBL. 5 REF.Article

  • Page / 4647