| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1044 2 |
| Ultima descărcare din IBN: 2017-04-28 22:12 |
| Căutarea după subiecte similare conform CZU |
| 004.43 (45) |
| Programe. Software (295) |
 SM ISO690:2012ALHAZOV, Artiom, ROGOZHIN, Yurii. Generating Languages by P Systems with Minimal Symport/Antiport. In: Computer Science Journal of Moldova, 2006, nr. 3(42), pp. 299-323. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 3(42) / 2006 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.43 | ||||||
| Pag. 299-323 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
It is known that P systems with two membranes and minimal
symport/antiport rules are “almost” computationally complete
as generators of number or vector sets.
Interpreting the result of the computation as the sequence
of terminal symbols sent to the environment, we show that P
systems with two membranes and symport rules of weight two
or symport/antiport rules of weight one generate all recursively
enumerable languages. |
||||||
|
|
|
|
