Abstract
k-limited and uniformly k-limited TOL systems provide limitations of the parallel rewriting of TOL systems. According to these systems the rewriting is carried out in a manner which lies between fully parallel and sequential rewriting. The degree ofsynchronization of such a system or of a TOL system is given by the number of its tables and the degree of nondeterminism is defined by the maximum, taken over all tables, of the maximal number of productions with the same left side in such a table. For a language L generated by such a system, taking the minimum of the corresponding degree of all such systems generating L, we get the corresponding complexity measures of the languages of the appropriate language families. As a new complexity measure we introduce the product of both degrees. The relations between these different measures are investigated.
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.
