| Abstract |
|
In this papeq we consider P systems with membrane creation
working with symbol objects. As a result of a halting
computation we do not take the set of numbers generated in
a designated output membrane, instead we take the resulting
tree representing the membrane structure of the final
configuration. We prove that each recursively enumerable
tree language can be obtained by this system.
|
Additional Information
|
Citation:
R. Rama, H. Ramesh,
"On Generating Trees by P Systems with Active Membranes,"
synasc,
pp. 462-466,
Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05),
2005
|