JUCS - Journal of Universal Computer Science 1(2): 105-130, doi: 10.3217/jucs-001-02-0105
A Variant of Team Cooperation in Grammar Systems
expand article infoRudolf Freund‡, Gheorghe Paun§
‡ Technical University Wien, Institute for Computer Languages, Vienna, Austria§ Institute of Mathematics of the Romanian Academy, Bucharest, Romania

Corresponding author: Rudolf Freund ( freund@csdec1.tuwien.ac.at )

© Rudolf Freund, Gheorghe Paun.
This article is freely available under the J.UCS Open Content License.
Citation: Freund R, Paun G (1995) A Variant of Team Cooperation in Grammar Systems. JUCS - Journal of Universal Computer Science 1(2): 105-130. https://doi.org/10.3217/jucs-001-02-0105
Open Access
Abstract
We prove that grammar systems with (prescribed or free) teams (of constant size at least two or arbitrary size) working as long as they can do, characterize the family of languages generated by (context-free) matrix grammars with appearance checking; in this way, the results in [Paun, Rozenberg 1994] are completed and improved.
Keywords
Formal languages, grammar systems, teams