A Variant of Team Cooperation in Grammar Systems

Rudolf Freund (Technical University Wien, Institute for Computer Languages, Austria)

Gheorghe Paun (Institute of Mathematics of the Romanian Academy of Sciences, Romania)

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

Categories: F.4.2, F.4.3