Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FORMAL GRAMMAR")

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

Results 1 to 25 of 950

  • Page / 38

Export

Selection :

  • and

SUR QUELQUES GRAMMAIRES AVEC REGLES DE SUBSTITUTION GLOBALESLEVITINA MK.1972; NAUCH.-TEKH. INFORM., 2; S.S.S.R.; DA. 1972; NO 3; PP. 32-36; ABS. ANGL.; BIBL. 9REF.Serial Issue

LES GRAMMAIRES DE GROUPES SYNTAXIQUESGALYUKSHOV BS.1975; NAUCH.-TEKH. INFORM., 2; S.S.S.R.; DA. 1975; NO 1; PP. 31-37; BIBL. 2REF.Article

SUR LA HAUTEUR DES ARBRES DE SUBORDINATION POUR DES LANGAGES DEFINIS PAR DES GRAMMAIRES DE CATEGORIESSHPIL'FOJGEL EI.1973; NAUCH.-TEKH. INFORM., 2; S.S.S.R.; DA. 1973; NO 4; PP. 28-33; ABS. ANGL.; BIBL. 2REF.Serial Issue

ELEMENTS DE LINGUISTIQUE MATHEMATIQUEGLADKIJ AV; MEL'CUK IA.1972; PARIS; DUNOD; DA. 1972; PP. (181P.); BIBL. 6P.; TRAD. DU RUSSE PAR J. COHEN, D. HERAULT. (MONOGR. LINGUIST. MATH. 4)Book

USING SLOTS AND MODIFIERS IN LOGIC GRAMMARS FOR NATURAL LANGUAGEMCCORD MC.1982; ARTIFICIAL INTELLIGENCE; ISSN 0374-2539; NLD; DA. 1982; VOL. 18; NO 3; PP. 327-367; BIBL. 39 REF.Article

A GENERAL FRAMEWORK FOR COMPARING SEQUENTIAL AND PARALLEL REWRITINGKLEIJN HCM; ROZENBERG G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 360-368; BIBL. 8 REF.Conference Paper

AN EXTENSION OF TREE ADJUNCT GRAMMARSUPTON RA.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 51; NO 3; PP. 248-274; BIBL. 15 REF.Article

LL(K) PARSING BY A CANONICAL P.D.A. USING BOUNDED CONTEXT TECHNIQUE.TERRINE G; COUHAULT AM.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 222; PP. 1-18; ABS. ANGL.Serial Issue

BASIC FORMULAS AND LANGUAGES. I: THE THEORYEHRENFEUCHT A; ROZENBERG G; VERRAEDT R et al.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 4; PP. 235-255; BIBL. 8 REF.Article

ALGORITHME DE RECONNAISSANCE POUR UNE CLASSE DE GRAMMAIRES PARAMETRIQUES DU TYPE QUASI RECURSIFEVLADENKO VN.1980; PROGRAMMIROVANIE; SUN; DA. 1980; NO 5; PP. 26-30; BIBL. 4 REF.Article

A NEW DEFINITION FOR SIMPLE PRECEDENCE GRAMMARSAMIRAM YEHUDAI.1979; B.I.T.; DNK; DA. 1979; VOL. 19; NO 2; PP. 282-284; BIBL. 3 REF.Article

A CONCEPT OF GRAMMAR FOR INFORMATION SEARCH.BANCZEROWSKI J.1975; BIUL. FONOGR.; POLSKA; DA. 1975; VOL. 15; PP. 33-54; BIBL. DISSEM.Article

EFFICIENT ERROR-CORRECTING PARSING FOR (ATTRIBUTED AND STOCHASTIC) TREE GRAMMARSSHI QING YUN; FU KS.1982; INFORMATION SCIENCES (NEW YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 26; NO 2; PP. 159-188; BIBL. 10 REF.Article

Tests for the LR-LL-, and LC-regular conditionsHEILBRUNNER, S.Journal of computer and system sciences (Print). 1983, Vol 27, Num 1, pp 1-13, issn 0022-0000Article

A PRIME DECOMPOSITION THEOREM FOR GRAMMATICAL FAMILIESGINSBURG S; GOLDSTINE J; SPANIER EH et al.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 3; PP. 315-361; BIBL. 7 REF.Article

BASIC FORMULAS AND LANGUAGES. II: APPLICATIONS TO EOL SYSTEMS AND FORMSEHRENFEUCHT A; ROZENBERG G; VERRAEDT R et al.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 1; PP. 11-22; BIBL. 9 REF.Article

PROBLEME D'EQUIVALENCE POUR LA GENERALISATION DES LL (K)-GRAMMAIRESNEPOMNYASHCHAYA A SH.1981; PROGRAMMIROVANIE; SUN; DA. 1981; NO 5; PP. 3-10; BIBL. 6 REF.Article

ERWEITERUNGEN VON DENDROGRAMMATIKEN = GENERALISATIONS DES DENDROGRAMMAIRESLIPPE WM.1980; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1980; VOL. 16; NO 1-3; PP. 21-39; ABS. RUS/ENG; BIBL. 14 REF.Article

APPLICABILITY OF A PRODUCTION IN A CATEGORICAL GRAMMARKURKA P.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 37-44; BIBL. 9 REF.Article

BIBLIOGRAPHY ON ATTRIBUTE GRAMMARSRAIHA KJ.1980; SIGPLAN NOT.; USA; DA. 1980; VOL. 15; NO 3; PP. 35-44Article

ON STRICT INTERPRETATIONS OF GRAMMAR FORMSGINSBURG S; LEONG B; MAYER O et al.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 12; NO 3; PP. 233-252; 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

MODELES ET CALCULS LINGUISTIQUESALEEV VR; MANSUROV VN.1979; KIBERNETIKA; UKR; DA. 1979; NO 5; PP. 34-37; ABS. ENG; BIBL. 3 REF.Article

  • Page / 38