Solution to PSPACE-Complete Problem Using P Systems with Active Membranes with Time-Freeness
P systems with active membranes are powerful parallel natural computing models, which were inspired by cell structure and behavior. Inspired by the parallel processing of biological information and with the idealistic assumption that each rule is completed in exactly one time unit, P systems with ac...
Main Authors: | Bosheng Song, Yuan Kong |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2019-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2019/5793234 |
Similar Items
-
The equivalence problem for programs with mode switching is PSPACE-complete.
by: Rimma Podlovchenko, et al.
Published: (2006-01-01) -
Task and Motion Planning Is PSPACE-Complete
by: Vega-Brown, William R, et al.
Published: (2021) -
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
by: Mila Majster-Cederbaum, et al.
Published: (2013-12-01) -
PSPACE-completeness of Pulling Blocks to Reach a Goal
by: Ani, Joshua, et al.
Published: (2022) -
1 × 1 rush hour with fixed blocks is PSPACE-complete
by: Brunner, Josh, et al.
Published: (2021)