Prefix and equality languages of rational functions are co-context-free
References (10)
Every iterated morphism yields a co-cfl
Inform. Process. Lett.
(1986)- et al.
Equality languages and fixed point languages
Inform. & Control
(1979) - et al.
What makes some language theory problems undecidable
J. Comput. System Sci.
(1970) An infinite square-free co-CFL
Inform. Process. Lett.
(1985)Transductions and Context-Free Languages
(1979)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1988 Published by Elsevier B.V.