Fixed languages and the adult languages of ol schemest
Tom Head · International Journal of Computer Mathematics · 1981
The fixed language of an endomorphism of a free monoid is shown to be method that provides a concide description of the basis of the fixed language. A supplementary disscussion shown that the adult language of an OL scheme is free and provides a simple listing procedure for the basis element.