Abstract
We consider sets of grammars (calledteams) which process strings by cooperating together; a single derivation step in a team is done in such a way that each grammar in the set rewrites a symbol in the string. A cooperating grammar system with prescribed teams (CPT) consists of a finite number of teams. In a maximal rewriting mode, a team in a CPT can take a string for rewriting whenever it can make a derivation step on it; it keeps it and rewrites as long as it can, and once a string is obtained that cannot be rewritten by the team anymore it is returned and becomes available to all other teams.
In this paper we investigate the power of CPT in the maximal and other rewriting modes. We establish the relationships of CPT with other models of grammars cooperating together and with various kinds of controlled grammars. We also solve some open problems from [6] and provide alternative proofs for some results from [6].
Similar content being viewed by others
References
Brandenburg, F.J.: On context-free grammars with regular control sets. 7th Conf. on Automata and Formal Languages. Salgotarjan 1993
Csuhaj-Varju, E., Dassow, J.: On cooperating distributed grammar systems. J. Inf. Process. Cybern. EIK26, 49–63 (1990)
Csuhaj-Varju, E., Dassow, J., Kelemen, J., Pâun, Gh.: Grammar Systems. London: Gordon and Breach 1994
Csuhaj-Varju, E., Pâun, Gh.: Limiting the size of teams in cooperating grammar systems. Bull. EATCS51, 198–202 (1993)
Dassow, J., Pâun, Gh.: Regulated rewriting in formal language theory. Berlin, Heidelberg, New York: Springer 1989
Kari, L., Mateescu, Al., Pâun, Gh., Salomaa, A.: Teams in cooperating grammar systems. J. Exp. Theor. AI (in press)
Meersman, R., Rozenberg, R.: Cooperating grammar systems. Proc. MFCS'78 Symp. (Lect. Notes Comput. Sci., vol. 64, pp. 364–374), Berlin, Heidelberg, New York: Springer 1978
Nii, P.H.: Blackboard systems. In: Barr, A., Cohen, P.R., Feigenbaum, E.A., (eds.) The Handbook of AI, vol. 4 Reading, NJ: Addison-Wesley 1989
Rozenberg, G., Salomaa, A.: The mathematical theory of L systems New York: Academic Press 1980
Salomaa, A.: Formal languages. New York: Academic Press 1973
Author information
Authors and Affiliations
Additional information
The authors are indebted to Basic Research ASMICS II Working Group for supoort; the work of the first author has been also supported by the Alexander von Humboldt Foundation
Rights and permissions
About this article
Cite this article
PĂun, G., Rozenberg, G. Prescribed teams of grammars. Acta Informatica 31, 525–537 (1994). https://doi.org/10.1007/BF01213205
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01213205