Abstract
In this paper we consider different regulation mechanisms imposed upon k-limited ETOL systems. We investigate matrix, periodically time varying, graph-controlled and programmed systems on the one side and random context and random context with appearance checking systems on the other side. We also regard mixtures of these two types. By these means, in case of k-limited TOL systems, we increase the generative power of the systems while in case of k-limited ETOL systems this is, at least partially, not true. We compare the different language families with each other as well as with other known language families.
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.
