2017
DOI: 10.1016/j.tcs.2017.05.020
|View full text |Cite
|
Sign up to set email alerts
|

Further results on generalised communicating P systems

Abstract: Bradford Scholars -how to deposit your paper Overview Copyright check• Check if your publisher allows submission to a repository.• Use the Sherpa RoMEO database if you are not sure about your publisher's position or email openaccess@bradford.ac.uk.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Generalized communicating P systems, where the rules of this tissue-like membrane systems describe the move of pairs of objects from pairs of compartments to new locations (each object of the pair is moved to a new compartment) demonstrate functional similarity to P colonies. Initial steps in this direction have been made in [46].…”
Section: Open Problems and Conclusionmentioning
confidence: 99%
“…Generalized communicating P systems, where the rules of this tissue-like membrane systems describe the move of pairs of objects from pairs of compartments to new locations (each object of the pair is moved to a new compartment) demonstrate functional similarity to P colonies. Initial steps in this direction have been made in [46].…”
Section: Open Problems and Conclusionmentioning
confidence: 99%
“…This has been modelled in different formalisms, including Petri nets [27] and generalised membrane systems using rewriting rules [1]. Recently, another approach based on generalised communicating P systems has been presented [17]. A slightly different version of this problem, using numerical P systems has been considered [24,25].…”
Section: Producer/consumer Examplementioning
confidence: 99%
“…It has been shown that even restricted variants of these constructs (with respect to the form of rules) are able to generate any recursively enumerable set of numbers. Furthermore, several of them even with relatively small numbers of cells and with simple underlying hypergraph architectures are computationally complete [3], [5][6][7]. It is also shown that the maximal expressive power can also be obtained with GCPSs where the alphabet of objects is a singleton [2].…”
mentioning
confidence: 98%