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

On subword complexity functionsSAJO, A.Discrete applied mathematics. 1984, Vol 8, Num 2, pp 209-212, issn 0166-218XArticle

Remarks on an example of JantzenPOTTS, D. H; BOOK, R.Theoretical computer science. 1984, Vol 29, Num 3, pp 277-284, issn 0304-3975Article

Regular-like tree expressionsBARRERO, A; THOMASON, M. G; GONZALEZ, R. C et al.International journal of computer & information sciences. 1983, Vol 12, Num 1, pp 1-11, issn 0091-7036Article

On the exponentiation of languagesKUICH, Werner; WAGNER, Klaus W.Lecture notes in computer science. 2003, pp 376-386, issn 0302-9743, isbn 3-540-40543-7, 11 p.Conference Paper

On universally polynomial context-free languagesTRAN, Nicholas.Lecture notes in computer science. 2001, pp 21-27, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Characterization of context-free languages with polynomially bounded ambiguityWICH, Klaus.Lecture notes in computer science. 2001, pp 703-714, issn 0302-9743, isbn 3-540-42496-2Conference Paper

A non-left-to-right, non-directional parser for ambiguous latticesGIORDANA, A; SAITTA, L.Pattern recognition letters. 1985, Vol 3, Num 2, pp 105-111, issn 0167-8655Article

An improved error-correcting parser for a context-free languageTANAKA, E.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1984, Vol 67, Num 7, pp 379-385, issn 0387-236XArticle

Safety in grammatical protection systemsBUDD, T. A.International journal of computer & information sciences. 1983, Vol 12, Num 6, pp 413-431, issn 0091-7036Article

Star-free open languages and aperiodic loopsBEAUDRY, Martin; LEMIEUX, Francois; THERIEN, Denis et al.Lecture notes in computer science. 2001, pp 87-98, issn 0302-9743, isbn 3-540-41695-1Conference Paper

Fast recognition of deterministic cfl's with a smaller number of processorsMONIEN, B; RYTTER, W; SCHÄPERS, L et al.Theoretical computer science. 1993, Vol 116, Num 2, pp 421-429, issn 0304-3975Article

Approximately matching context-free languagesMYERS, G.Information processing letters. 1995, Vol 54, Num 2, pp 85-92, issn 0020-0190Article

An infinite square-free co-CFLMAIN, M. G.Information processing letters. 1985, Vol 20, Num 2, pp 105-107, issn 0020-0190Article

Bicentres de langages algébriques = Bicenters of context-free languagesAUTEBERT, J. M; BEAUQUIER, J; BOASSON, L et al.Acta informatica. 1984, Vol 21, Num 2, pp 209-227, issn 0001-5903Article

Groups, the theory of ends, and context-free languagesMULLER, D. E; SCHUPP, P. E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 295-310, issn 0022-0000Article

The entropy of Lukasiewicz-languagesSTAIGER, Ludwig.Lecture notes in computer science. 2002, pp 155-165, issn 0302-9743, isbn 3-540-43453-4Conference Paper

Prefix and equality languages of rational functions are co-context-freeENGELFRIET, J; HOOGEBOOM, H. J.Information processing letters. 1988, Vol 28, Num 2, pp 77-79, issn 0020-0190Article

An «Interchange Lemma» for context-free languagesOGDEN, W; ROSS, R. J; WINKLMANN, K et al.SIAM journal on computing (Print). 1985, Vol 14, Num 2, pp 410-415, issn 0097-5397Article

Semi-discrete context-free languagesLATTEUX, M; THIERRIN, G.International journal of computer mathematics. 1983, Vol 14, Num 1, pp 3-18, issn 0020-7160Article

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

On the Chomsky and Stanleýs homomorphic characterization of context-free languagesHIROSE, S; YONEDA, M.Theoretical computer science. 1985, Vol 36, Num 1, pp 109-112, issn 0304-3975Article

Recurrent words for substitutionSAKAROVITCH, J; NISHIDA, T; KOBUCHI, Y et al.Mathematical systems theory. 1984, Vol 17, Num 3, pp 199-215, issn 0025-5661Article

On a conjecture about slender context-free languagesILIE, L.Theoretical computer science. 1994, Vol 132, Num 1-2, pp 427-434, issn 0304-3975Article

Comparisons between some pumping conditions for context-free languagesHEWETT, R; SLUTZKI, G.Mathematical systems theory. 1989, Vol 21, Num 4, pp 223-233, issn 0025-5661Article