109

urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891

JUCS - Journal of Universal Computer Science

jucs

0948-695X 0948-6968

Journal of Universal Computer Science

10.3217/jucs-001-02-0105

27099

Research Article

F.4.2 - Grammars and Other Rewriting Systems F.4.3 - Formal Languages

A Variant of Team Cooperation in Grammar Systems

Freund

Rudolf

freund@csdec1.tuwien.ac.at 1 Paun

Gheorghe

Technical University Wien, Institute for Computer Languages, Vienna, Austria

Technical University Wien, Institute for Computer Languages

Vienna

Austria 2

Institute of Mathematics of the Romanian Academy, Bucharest, Romania

Institute of Mathematics of the Romanian Academy

Bucharest

Romania

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

Academic editor:

1995

28 02 1995

1 2 105 130 E21B1D9D-374C-5463-BF60-2500FA5F4023 6995062

Rudolf Freund, Gheorghe Paun

This article is freely available under the J.UCS Open Content License.

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.