Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22GRAMMAIRE CF%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 6986

  • Page / 280
Export

Selection :

  • and

A parsing method for context-free languages using bottom-up lookahead computationWATANABE, Y; TOKUDA, T.Systems and computers in Japan. 1996, Vol 27, Num 10, pp 14-22, issn 0882-1666Article

Self-embbeding indexed grammarsPARCHMANN, R; DUSKE, J.Theoretical computer science. 1986, Vol 47, Num 2, pp 219-223, issn 0304-3975Article

Regulation by valencesFERNAU, H; STIEBE, R.Lecture notes in computer science. 1997, pp 239-248, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Tree-adjoining grammersComputational intelligence. 1994, Vol 10, Num 4, issn 0824-7935, 274 p.Serial Issue

Prefixes of infinite words and ambiguous context-free languagesAUTEBERT, Jean-Michel; FLAJOLET, Philippe; GABARRO, Joaquim et al.Rapport de recherche I.N.R.I.A, ISSN: 0249-6399 ; 492. 1986, 1 p.Report

Inferring subclasses of contextual languagesEMERALD, J. D; SUBRAMANIAN, K. G; THOMAS, D. G et al.Lecture notes in computer science. 2000, pp 65-74, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Sublinear ambiguityWICH, K.Lecture notes in computer science. 2000, pp 690-698, issn 0302-9743, isbn 3-540-67901-4Conference Paper

XML grammarsBERSTEL, J; BOASSON, L.Lecture notes in computer science. 2000, pp 182-191, issn 0302-9743, isbn 3-540-67901-4Conference Paper

Prefixes of infinite words and ambiguous context-free languagesAUTEBERT, J.-M; FLAJOLET, P; GABARRO, J et al.Information processing letters. 1987, Vol 25, Num 4, pp 211-216, issn 0020-0190Article

Context-free valence grammars: RevisitedHOOGEBOOM, Hendrik Jan.Lecture notes in computer science. 2002, pp 293-303, issn 0302-9743, isbn 3-540-43453-4Conference Paper

Constructive learning of context-free languages with a subpansive treeSUGIMOTO, N; TOYOSHIMA, T; SHIMOZONO, S et al.Lecture notes in computer science. 2000, pp 270-283, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Investigations on Hotz groups for arbitrary grammarsDIEKERT, V.Acta informatica. 1986, Vol 22, Num 6, pp 679-698, issn 0001-5903Article

Context-free text grammarsEHRENFEUCHT, A; TEN PAS, P; ROZENBERG, G et al.Acta informatica. 1994, Vol 31, Num 2, pp 161-206, issn 0001-5903Article

Universal inherence of cycle-free context-free ambiguity functionsWICH, Klaus.Lecture notes in computer science. 2002, pp 669-680, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Every iterated morphism yields a co-CFLBERSTEL, J.Information processing letters. 1986, Vol 22, Num 1, pp 7-9, issn 0020-0190Article

Incremental learning of context free grammarsNAKAMURA, Katsuhiko; MATSUMOTO, Masashi.Lecture notes in computer science. 2002, pp 174-184, issn 0302-9743, isbn 3-540-44239-1, 11 p.Conference Paper

Tree k-grammar models for natural language modelling and parsingVERDU-MAS, Jose L; FORCADA, Mikel L; CARRASCO, Rafael C et al.Lecture notes in computer science. 2002, pp 56-63, issn 0302-9743, isbn 3-540-44011-9, 8 p.Conference Paper

On array grammars and languagesSUBRAMANIAN, K. G; RANI SIROMONEY.Cybernetics and systems. 1987, Vol 18, Num 1, pp 77-98, issn 0196-9722Article

Comparing computational representations of Herbrand modelsMATZINGER, R.Lecture notes in computer science. 1997, pp 203-218, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Bidirectional context-free grammar parsing for natural language processingSATTA, G; STOCK, O.Artificial intelligence. 1994, Vol 69, Num 1-2, pp 123-164, issn 0004-3702Article

Context-free languages over infinite alphabetsCHENG, E. Y. C; KAMINSKI, M.Acta informatica. 1998, Vol 35, Num 3, pp 245-267, issn 0001-5903Article

Context-free graph languages of bounded degree are generated by apex graph grammarsENGELFRIET, J; HEYKER, L; LEIH, G et al.Acta informatica. 1994, Vol 31, Num 4, pp 341-378, issn 0001-5903Article

Time varying pushdown automataKAMALA KRITHIVASAN; SRINIVASAN, V.International journal of computer mathematics. 1988, Vol 24, Num 3-4, pp 223-236, issn 0020-7160Article

Database of grammatical sentences of Croatian languageTEPES, Bozidar; MATELJAN, Vladimir; STOIANOV, Tomislav et al.Information technology interfaces. 2001, pp 423-432, isbn 953-96769-3-2Conference Paper

Synthesizing context free grammars from sample strings based on inductive CYK algorithmNAKAMURA, K; ISHIWATA, T.Lecture notes in computer science. 2000, pp 186-195, issn 0302-9743, isbn 3-540-41011-2Conference Paper

  • Page / 280