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

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

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

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

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

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

The word problem for inverse monoids presented by one idempotent relatorBIRGET, J.-C; MARGOLIS, S. W; MEAKIN, J. C et al.Theoretical computer science. 1994, Vol 123, Num 2, pp 273-289, issn 0304-3975Article

Intreractive proof systems and alternating time-space complexityFORTNOW, L; LUND, C.Theoretical computer science. 1993, Vol 113, Num 1, pp 55-73, issn 0304-3975Conference Paper

An infinite word language which is not co-CFLGRAZON, A.Information processing letters. 1987, Vol 24, Num 2, pp 81-85, issn 0020-0190Article

Making nondeterminism unambiguousREINHARDT, K; ALLENDER, E.SIAM journal on computing (Print). 2000, Vol 29, Num 4, pp 1118-1131, issn 0097-5397Article

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

On perrely morphic characterizations of context- free languagesYOKOMORI, T.Theoretical computer science. 1987, Vol 51, Num 3, pp 301-308, issn 0304-3975Article

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

Extended regular expressions of star degree at most twoHASHIGUCHI, K; YOO, H.Theoretical computer science. 1990, Vol 76, Num 2-3, pp 273-284, issn 0304-3975, 12 p.Article

Prime decompositions of regular languagesHAN, Yo-Sub; SALOMAA, Kai; WOOD, Derick et al.Lecture notes in computer science. 2006, pp 145-155, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 11 p.Conference Paper

Separation results for rebound automataPETERSEN, H.Lecture notes in computer science. 2000, pp 589-598, issn 0302-9743, isbn 3-540-67901-4Conference Paper

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

Forgetting automata and context-free languagesJANCAR, P; MRAZ, F; PLATEK, M et al.Acta informatica. 1996, Vol 33, Num 5, pp 409-420, issn 0001-5903Article

Binary self-adding sequences and languagesILIE, L; MITRANA, V.International journal of computer mathematics. 1996, Vol 62, Num 3-4, pp 171-181, issn 0020-7160Article

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