Computing with Membranes: P Systems with Worm-Objects

Show simple item record Castellanos, J en Paun, G en Rodriguez-Paton, A en 2009-04-16T23:17:55Z en 2009-04-16T23:17:55Z en 2000-02 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-123 (2000) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri en
dc.description.abstract We consider a combination of P systems with objects described by symbols with P systems with objects described by strings. Namely, we work with multisets of strings and consider as the result of a computation the number of strings in a given output membrane. The strings (also called worms) are processed by replication, splitting, mutation, and recombination; no priority among rules and no other ingredient is used. In these circumstances, it is proved that (1) P systems of this type can generate all recursively enumerable sets of numbers, and, moreover, (2) the Hamiltonian Path Problem in a directed graph can be solved in a quadratic time, while the SAT problem can be solved in a linear time. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights.uri en
dc.source.uri en
dc.title Computing with Membranes: P Systems with Worm-Objects en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en
dc.rights.accessrights en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace