Abstract
Non-returning PC grammar systems with n context free components are simulated in [3] by returning PC grammar systems with 4 n 2 − 3 n + 1 components. In this paper we reduce the number of components of the simulating system by using a different simulating construction. The number of simulating components can be further decreased if the queries appearing in some of the components satisfy a simple condition, which all queries in regular and linear grammars naturally do. This number can be as low as 2 n, while in general it is still ( n + 1) 2.
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.
