Stability in OL systems
Taishin Y. Nishida, Youichi Kobuchi · International Journal of Computer Mathematics · 1983
Some properties of recurrent strings with respect to an OL scheme and an OL system are discussed. A recurrent string is factorized into some elementary recurrent strings. The two decision problems are shown to be decidable: One is whether or not a given string is recurrent with respect to an OL scheme. The other is whether or not a given OL language contains some recurrent strings.