Abstract
Coverability trees offer a finite characterization of all the derivations of a context-free parallel grammar system (CF-PCGS). Their finite nature implies that they necessarily omit some information about these derivations. We demonstrate that the omitted information is most if not all of the time too much, and so coverability trees are not useful as an analysis tool except for their limited use already considered in the paper that introduces them (namely, determining the decidability of certain decision problems over PCGS). We establish this result by invalidating an existing proof that synchronized CF-PCGS are less expressive than context-sensitive grammars. Indeed, we discover that this proof relies on coverability trees for CF-PCGS, but that such coverability trees do not in fact contain enough information to support the proof.
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.
