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) tea...
Elmentve itt :
Szerzők: | |
---|---|
Dokumentumtípus: | Cikk |
Megjelent: |
1996
|
Sorozat: | Acta cybernetica
12 No. 4 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Tárgyszavak: | |
Online Access: | http://acta.bibl.u-szeged.hu/12568 |
Tartalmi kivonat: | 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. |
---|---|
Terjedelem/Fizikai jellemzők: | 361-379 |
ISSN: | 0324-721X |