Abstract
In [13], different regulation mechanisms imposed upon /c-limited TOL systems have been considered. Additionally, in this paper we investigate regularly controlled /c-limited TOL systems with or without random context and with or without appearance checking. By these kinds of control mechanisms, we further increase the generative power of the systems. Especially, we can demonstrate that for every k e IN, the family of random context regularly controlled /clTOL languages with appearance checking equals the family of recursively enumerable languages.
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.
