Abstract
We introduce the notion of recurrent words in TOL systems. We prove that for an arbitrarily given TOL system G and an arbitrarily given word w it is decidable whether or not w is recurrent in G . We also solve an open and related problem for recurrent words in Markov DTOL systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
