The paper is about some families of rewriting P systems, where the application of evolution rules is extended from the classical sequential rewriting to the parallel one (as, for instance, in Lindenmayer systems). As a result, consistency problems for the communication of strings may arise. Three variants of parallel rewriting P systems (already present in the literature) are considered here, together with the strategies they use to face the communication problem, and some parallelism methods for string rewriting are defined. We give a survey of all known results about each variant and we state some relations among the three variants, thus establishing hierarchies of parallel rewriting P systems. Various open problems related to the subject are also presented.
Besozzi, D., Mauri, G., & Zandron, C. (2004). Hierarchies of parallel rewriting P systems - a survey. NEW GENERATION COMPUTING, 22(4), 331-347 [10.1007/BF03037285].
Citazione: | Besozzi, D., Mauri, G., & Zandron, C. (2004). Hierarchies of parallel rewriting P systems - a survey. NEW GENERATION COMPUTING, 22(4), 331-347 [10.1007/BF03037285]. | |
Tipo: | Articolo in rivista - Articolo scientifico | |
Carattere della pubblicazione: | Scientifica | |
Presenza di un coautore afferente ad Istituzioni straniere: | No | |
Titolo: | Hierarchies of parallel rewriting P systems - a survey | |
Autori: | Besozzi, D; Mauri, G; Zandron, C | |
Autori: | ||
Data di pubblicazione: | 2004 | |
Lingua: | English | |
Rivista: | NEW GENERATION COMPUTING | |
Sostituisce: | http://hdl.handle.net/10281/12029 | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/BF03037285 | |
Appare nelle tipologie: | 01 - Articolo su rivista |