Simple variants of non-cooperative polymorphic P systems

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 rest...

Full description

Saved in:
Bibliographic Details
Published inJournal of membrane computing Vol. 6; no. 3; pp. 179 - 192
Main Authors Kuczik, Anna, Vaszil, György
Format Journal Article
LanguageEnglish
Published Singapore Springer Nature Singapore 01.09.2024
Subjects
Artificial Intelligence
Computation by Abstract Devices
Computational Biology/Bioinformatics
Computer Science
Optimization
Research Paper
Theory of Computation
Parikh sets of ET0L languages
P systems with non-cooperative rules
P systems with dynamic rules
Polymorphic P systems
P systems with limited depth
Online AccessGet full text
ISSN2523-8906
2523-8914
2523-8914
DOI10.1007/s41965-024-00145-0

Cover

More Information
Summary: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.
ISSN:2523-8906
2523-8914
2523-8914
DOI:10.1007/s41965-024-00145-0