| Autor: |
Kuczik, Anna, Vaszil, György |
| Zdroj: |
Journal of Membrane Computing; September 2024, Vol. 6 Issue: 3 p179-192, 14p |
| Abstrakt: |
We investigate the computational power of non-cooperative polymorphic P systems with no additional ingredients. The variants we study are even more simple in the sense that the sets of possible right-hand sides of the dynamically changing rules are finite. We show that systems with this type of restriction characterize exactly the class of Parikh sets of ET0L languages. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Full text from SpringerLink