Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ARBRE DERIVATION")

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

Results 1 to 25 of 36

  • Page / 2
Export

Selection :

  • and

ATTRIBUTE GRAMMARS AND MATHEMATICAL SEMANTICSMAYOH BH.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 503-518; BIBL. 19 REF.Article

DERIVATIVES OF TREE SETS WITH APPLICATIONS TO GRAMMATICAL INFERENCELEVINE B.1981; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1981; VOL. 3; NO 3; PP. 284-293; BIBL. 18 REF.Article

DERIVATION STRUCTURES FOR STRICTLY CONTEXT-SENSITIVE GRAMMARSHART JM.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 45; NO 1; PP. 68-89; BIBL. 17 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

LINKED FOREST MANIPULATION SYSTEMS. A TOOL FOR COMPUTATIONAL SEMANTICSCULIK K II; MANSOUR FARAH.1981; ADV. INF. SYST. SCI.; ISSN 0065-2784; USA; DA. 1981; VOL. 8; PP. 75-118; BIBL. 14 REF.Article

THE USE OF TREE DERIVATIVES AND A SAMPLE SUPPORT PARAMETER FOR INFERRING TREE SYSTEMSLEVINE B.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 1; PP. 25-34; BIBL. 19 REF.Article

PASSES AND PATHS OF ATTRIBUTE GRAMMARSENGELFRIET J; FILE G.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 49; NO 2; PP. 125-169; BIBL. 1 P.Article

KONTEXTFREIE GRAMMATIKEN UND ABLEITUNGSBAEUME ALS HILFSMITTEL BEI DER PROGRAMMIERUNG = GRAMMAIRES CONTEXT-FREE ET ARBRES DE DERIVATION COMME OUTILS DE PROGRAMMATIONLINNEMANN V.1980; ANGEW. INFORMAT.; DEU; DA. 1980; NO 2; PP. 60-66; ABS. ENG; BIBL. 5 REF.Article

AN ORDER-ALGEBRAIC DEFINITION OF KNUTHIAN SEMANTICSCHIRICA LM; MARTIN DF.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 13; NO 1; PP. 1-27; BIBL. 33 REF.Article

THE AVERAGE STACK SIZE OF A DERIVATION TREE GENERATED BY A LINEAR CONTEXT-FREE GRAMMARKEMP R.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 3; PP. 354-365; BIBL. 6 REF.Article

PROCESSES OF TRANSFORMING STRUCTURESMAGGIOLO SCHETTINI A; WINKOWSKI J.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 3; PP. 245-282; BIBL. 11 REF.Article

SIMPLE MULTI-VISIT ATTRIBUTE GRAMMARSENGELFRIET J; FILE G.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 3; PP. 283-314; BIBL. 14 REF.Article

A NEW PROOF TECHNIQUE TO ESTABLISH EQUIVALENCE OF THE ORIGINAL AND THE GENERATED LAMBDA -FREE CFG WITH LINEAR INCREASE IN SIZEJAINENDRA NAVLAKHA.1982; BIT (NORD. TIDSKR. INF. BEHANDL.); ISSN 0006-3835; SWE; DA. 1982; VOL. 22; NO 1; PP. 17-26; BIBL. 3 REF.Article

ON THE TRANSFORMATION OF DERIVATION GRAPHS TO DERIVATION TREES (PRELIMINARY REPORT)BRANDENBURG FJ.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 224-233; BIBL. 14 REF.Conference Paper

A CHARACTERIZATION OF ATTRIBUTE EVALUATION IN PASSESALBLAS H.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 4; PP. 427-464; BIBL. 12 REF.Article

GENERATING FUNCTIONS FOR DERIVATION TREESKUICH W.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 45; NO 2; PP. 199-216; BIBL. 11 REF.Article

TWO ITERATION THEOREMS FOR THE LL(K) LANGUAGESBEATTY JC.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 12; NO 2; PP. 193-228; BIBL. 24 REF.Article

A THEORETICAL BASIS FOR THE SYSTEMATIC PROOF METHODBIBEL W.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 154-167; BIBL. 24 REF.Conference Paper

PARALLEL AND TWO-WAY AUTOMATA ON DIRECTED ORDERED ACYCLIC GRAPHSKAMIMURA T; SLUTZKI G.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 49; NO 1; PP. 10-51; BIBL. 23 REF.Article

THE CHARACTERIZATION OF PARALLEL ULTRALINEAR GRAMMARS BY RATIONAL POWER SERIESKUICH W.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 2; PP. 129-139; BIBL. 9 REF.Article

THE FORMAL POWER OF ONE-VISIT ATTRIBUTE GRAMMARSENGELFRIET J; FILE G.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 3; PP. 275-302; BIBL. 27 REF.Article

A NEW CHARACTERIZATION THEOREM OF TREE-TRANSDUCTIONSESTENFELD K.1982; ELEKTRONISCHE INFORMATIONSVERARBEITUNG UND KYBERNETIK; ISSN 0013-5712; DDR; DA. 1982; VOL. 18; NO 4-5; PP. 187-204; ABS. GER/RUS; BIBL. 15 REF.Article

ON THE HEIGHT OF DERIVATION TREESKUICH W; PRODINGER H; URBANEK J et al.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 370-384; BIBL. 10 REF.Conference Paper

On the size of unanbiguous context-free grammarsWYROSTEK, P.Theoretical computer science. 1986, Vol 47, Num 1, pp 107-110, issn 0304-3975Article

Monadic second-order evaluations on tree-decomposable graphsCOURCELLE, B; MOSBAH, M.Theoretical computer science. 1993, Vol 109, Num 1-2, pp 49-82, issn 0304-3975Conference Paper

  • Page / 2