An Infinite Word Language Which is Not co-CFL

Abstract The complement of the set of left factors of an infinite word satisfies the iteration lemma for context-free languages but can be ‘not context-free’.

[1]  David Haussler,et al.  Applications of an Infinite Squarefree CO-CFL , 1985, ICALP.

[2]  David Haussler,et al.  Applications of an Infinite Square-Free CO-CFL , 1987, Theor. Comput. Sci..

[3]  Michael G. Main,et al.  An Infinite Square-Free co-CFL , 1985, Inf. Process. Lett..

[4]  Jean Berstel.  Every Iterated Morphism Yields a co-CFL , 1986, Inf. Process. Lett..