Journal
SOFT COMPUTING
Volume 9, Issue 9, Pages 657-663Publisher
SPRINGER
DOI: 10.1007/s00500-004-0395-2
Keywords
membrane computing; recursively enumerable language; membrane polarization
Ask authors/readers for more resources
P systems with active membranes but without using electrical charges (polarizations) are shown to be complete for generating recursively enumerable string languages when working on string objects and using only rules with membrane transitions as well as rules with membrane dissolving and elementary membrane division, but also when using various other kinds of rules, even including a new type of rules allowing for membrane generation. In particular, allowing for changing membrane labels turns out to be a very powerful control feature.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available