kw.\*:(%22FONCTION CF PRESERVANTE%22)
Results 1 to 25 of 4764
Selection :
CONTEXT-FREE PRESERVING FUNCTIONS.RAO KOSARAJU S.1975; MATH. SYST. THEORY; U.S.A.; DA. 1975; VOL. 9; NO 3; PP. 193-197; BIBL. 8 REF.Article
Self-embbeding indexed grammarsPARCHMANN, R; DUSKE, J.Theoretical computer science. 1986, Vol 47, Num 2, pp 219-223, issn 0304-3975Article
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 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
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
Grammatical inference : algorithms and applications (Lisbon, 11-13 September 2000)Oliveira, Arlindo L.Lecture notes in computer science. 2000, issn 0302-9743, isbn 3-540-41011-2, VIII, 311 p, isbn 3-540-41011-2Conference Proceedings
Strong iteration lemmata for regular, linear, context-free, and linear indexed languagesDÖMÖSI, P; KUDLEK, M.Lecture notes in computer science. 1999, pp 226-233, issn 0302-9743, isbn 3-540-66412-2Conference Paper
Cancellation in context-free languages: enrichment by reductionJANTZEN, M; PETERSEN, H.Theoretical computer science. 1994, Vol 127, Num 1, pp 149-170, issn 0304-3975Article
Undecidable equivalences for basic process algebraGROOTE, J. F; HÜTTEL, H.Information and computation (Print). 1994, Vol 115, Num 2, pp 354-371, issn 0890-5401Article
Descriptional complexity of context-free grammar formsCSUHAJ-VARJU, E; KELEMENOVA, A.Theoretical computer science. 1993, Vol 112, Num 2, pp 277-289, issn 0304-3975Article
Hierarchy of k-context-free languages. ISALOMAA, K.International journal of computer mathematics. 1989, Vol 26, Num 2, pp 69-90, issn 0020-7160Article
LL(1) grammars and Sub-LL(1) grammarsCHEN JINHUA.International journal of computer & information sciences. 1985, Vol 14, Num 4, pp 225-234, issn 0091-7036Article
An inverse limit of context-free grammars: A new approach to identifiability in the limitMARTINEK, P.Lecture notes in computer science. 2000, pp 171-185, issn 0302-9743, isbn 3-540-41011-2Conference Paper
Group presentations, formal languages and characterizations of one-counter groupsHERBST, T; THOMAS, R. M.Theoretical computer science. 1993, Vol 112, Num 2, pp 187-213, issn 0304-3975Article
Hierarchy of k-context-free languages. IISALOMAA, K.International journal of computer mathematics. 1989, Vol 26, Num 3-4, pp 193-205, issn 0020-7160Article
Semantically driven parsing of context-free languagesSIDERI, M; EFREMIDIS, S; PAPAKONSTANTINOU, G et al.Computer journal (Print). 1989, Vol 32, Num 1, pp 91-93, issn 0010-4620Article