ABSTRACT
In the previous sections we have examined cooperating distributed systems of context-free grammars. The notion of a CD grammar system can be extended for systems with non-context-free components in an obvious way. However, these types of grammars can define grammar classes being very powerful and thus, by using the basic cooperation strategies, we do not obtain more in generative power. Another direction of investigations can be of interest; namely, are there grammars which prove to be universal cooperating partners in cooperation with other grammars being in a fixed class of grammars to generate all elements of a fixed language family.
