IO and OI
DOI:
https://doi.org/10.7146/dpb.v4i47.6466Abstract
A fixed point characterization of the inside-out (IO) and the 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 to context-free tree languages, to recognizable tree languages and to nondeterministic recursive program(scheme)s (called by value and called by name). The emptiness problem and closure properties of the context-free tree languages are discussed. Hierarchies of higher level equational subsets of an algebra are considered.Downloads
Published
1975-07-01
How to Cite
Engelfriet, J., & Schmidt, E. M. (1975). IO and OI. DAIMI Report Series, 4(47). https://doi.org/10.7146/dpb.v4i47.6466
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.