Abstract
A fixed-point characterization of the inside-out (IO) and outside-in (OI) context-free tree languages is given. This characterization is used to obtain a theory of nondeterministic systems of context-free equations with parameters. Several “Mezei-and-Wright-like” results are obtained which relate the context-free tree languages to recognizable tree languages and to nondeterministic recursive program(scheme)s (called by value and called by name). Closure properties of the context-free tree languages are discussed. Hierarchies of higher level equational subsets of an algebra are considered.
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.
