Abstract
In this paper we study some applications and generalizations of the yield theorem: the yield of a recognizable set of trees (dendrolanguage) is an indexed language [1]. Standard results on context-free languages can be obtained quickly using this theorem. We consider here the Peters-Ritchie theorem [4]: the language analyzable by a finite set of CS rules is CF. An extension of the yield theorem reads: the yield of a CF set of trees is an indexed language. We prove some closure properties of CF sets of trees. Applying the yield theorem, we obtain properties of indexed languages. As a special result, we can solve the infiniteness problem for such languages.
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.
