作者: Alberto Leporati , Luca Manzoni , Giancarlo Mauri , Antonio E. Porreca , Claudio Zandron
DOI: 10.1007/978-3-319-73359-3_13
关键词:
摘要: We solve affirmatively a new special case of the P conjecture by Gh. Păun, which states that systems with active membranes without charges and non-elementary membrane division cannot \(\mathbf {NP}\)-complete problems in polynomial time. The variant we consider is monodirectional, i.e., send-in communication rules, shallow, structures consisting only one level besides external membrane, deterministic, rather than more generally confluent. describe polynomial-time Turing machine simulation this systems, exploiting generalised version dependency graphs for which, unlike original introduced Cordon-Franco et al., also takes dissolution into account.