Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes

We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which characterize programmed grammars with the finite index restriction; looking at the number of components of such systems, we obtain surprisingly rich lattice structures for the inclusion relations between the corresponding language families. Secondly, we impose the finite index restriction on cooperating distributed grammar systems working in hybrid modes themselves, which leads us to new characterizations of programmed grammars of finite index.Comment: In Proceedings AFL 2014, arXiv:1405.527

Accepting Multi-Agent Systems II

We continue our previous research on cooperating distributed grammar systems (CDGS) and variants thereof as language acceptors [16]. Here, we classify the accepting capacity of CDGS working in the modes recently introduced by the authors together with Freund [14]. Moreover, we study (prescribed) teams as language accepting mechanisms. In this way, we solve an open problem from the area of accepting grammars: there exists a grammar family such that its generating capacity is strictly more powerful that its accepting capacity, see [6] for a recent survey