Abstract
Cooperating—distributed grammar systems [1] constitute a formal model of the blackboard model for problem solving. In [10], we have replaced the grammars in such systems by K-limited OL systems [9] each having the same alphabet. In this paper we generalize these cooperating—distributed limited OL systems by allowing arbitrary alphabets of the underlying systems and by adding a terminal alphabet. By these means, the generative power of the systems is increased. For these extended cooperating—distributed limited OL systems we can define quite a lot of different language families. But despite of the additional generative mechanisms, each such language family is included in the family of 1-limited ET0L languages.
Sign-in/Register to access full text options 
Free) 
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 call
