Every Iterated Morphism Yields a co-CFL

Abstract The set of left factors of any infinite word generated by an iterated morphism is shown to be the complement of a one-counter context-free language. This is used to solve a problem stated by Main, Bucher and Haussler (1985).

[1]  P. Pleasants.  Non-repetitive sequences , 1970, Mathematical Proceedings of the Cambridge Philosophical Society.

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

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

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

[5]  Sheila A. Greibach,et al.  An Infinite Hierarchy of Context-Free Languages , 1967, JACM.