Header menu link for other important links
On generating trees by P systems with active membranes
Published in
Volume: 2005
Pages: 462 - 466
In this paper, 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. © 2005 IEEE.
About the journal
JournalProceedings - Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2005
Open AccessNo
Concepts (8)
  •  related image
    Codes (symbols)
  •  related image
    Computation theory
  •  related image
    Computer programming languages
  •  related image
    Trees (mathematics)
  •  related image
    P systems
  •  related image
  •  related image
  •  related image
    Natural sciences computing