![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
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.
Keywords: