IO and OI. II

摘要

In Part 1 of this paper (J. Comput. System Sci. 15, Number 3 (1977)) we presented a fixed point characterization of the (IO and OI) context-free tree languages. We showed that a context-free tree grammar can be viewed as a system of regular equations over a tree language substitution algebra. In this part we shall use these results to obtain a theory of systems of context-free equations over arbitrary continuous algebras. We refer to the Introduction of Part 1 for a description of the contents of this part.