P systems with communication based on concentration

We consider a variant of P systems where the communication of objects is controlled by the "concentration" of these objects: after each evolution step, the objects are redistributed among the regions of the system in such a way that each region contains the same number of copies of each ob...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Dassow Jürgen
Păun Gheorghe
Dokumentumtípus: Cikk
Megjelent: 2001
Sorozat:Acta cybernetica 15 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12658
LEADER 01508nab a2200229 i 4500
001 acta12658
005 20220614120956.0
008 161015s2001 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Dassow Jürgen 
245 1 0 |a P systems with communication based on concentration  |h [elektronikus dokumentum] /  |c  Dassow Jürgen 
260 |c 2001 
300 |a 9-23 
490 0 |a Acta cybernetica  |v 15 No. 1 
520 3 |a We consider a variant of P systems where the communication of objects is controlled by the "concentration" of these objects: after each evolution step, the objects are redistributed among the regions of the system in such a way that each region contains the same number of copies of each object (plus/minus one, when the number of objects is not divisible by the number of regions). We show that P systems of this form, with only one flip-flop catalyst but without using other control ingredients, can generate the Parikh images of all matrix languages. When an unbounded number of catalysts is available, a characterization of recursively enumerable sets of vectors of natural numbers is obtained (by systems with only one membrane). 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
700 0 1 |a Păun Gheorghe  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/12658/1/cybernetica_015_numb_001_009-023.pdf  |z Dokumentum-elérés