Abstract
Rounds has defined the class of context-free tree languages and proved its closure properties under linear homomorphism and intersection with regular sets of trees. The open problem of closure under linear inverse homomorphism has just been solved negatively. As for context-free grammars we can define Greibach's forms for context-free grammars of tree languages. Unfortunately there are context-free tree languages without Greibach's grammar. We define tree grammars without left (or on the top) recursivity and show they generate exactly the class of Greibach's tree languages. Then we prove the closure of that class under linear inverse homomorphism. This result proves that Greibach's tree languages are strictly contained in context-free tree languages.
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.
