IO and OI. I
| Autor: | Joost Engelfriet, Erik Meineche Schmidt |
|---|---|
| Jazyk: | angličtina |
| Předmět: | |
| Zdroj: | Engelfriet, J & Schmidt, E M 1977, ' IO and OI. I ', Journal of Computer and System Sciences, vol. 15, no. 3, pp. 328-353 . https://doi.org/10.1016/S0022-0000(77)80034-2 |
| ISSN: | 0022-0000 |
| DOI: | 10.1016/S0022-0000(77)80034-2 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|