Abstract
AbstractThis paper considers multiple context‐free grammars (mcfg's) which inherit the basic properties of context‐free grammars with generative capacity stronger than that of context‐free grammars but weaker than that of context‐sensitive grammars. It is shown that the time complexity of the membership problem for languages generated by mcfg's is polynomial. It is shown also that head grammars introduced by Pollard for describing the syntax of natural language correspond to a special subclass of mcfg's and, as a corollary, the time complexity of the membership problem for languages generated by head grammars is of order n6.* This is an improvement by one order of magnitude, compared with the result by Pollard.
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.
