2015 | OriginalPaper | Chapter
Complexity Classes for Membrane Systems: A Survey
Authors : Giancarlo Mauri, Alberto Leporati, Luca Manzoni, Antonio E. Porreca, Claudio Zandron
Published in: Language and Automata Theory and Applications
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The computational power of membrane systems, in their different variants, can be studied by defining classes of problems that can be solved within given bounds on computation time or space, and comparing them with usual computational complexity classes related to the Turing Machine model. Here we will consider in particular membrane systems with active membranes (where new membranes can be created by division of existing membranes). The problems related to the definition of time/space complexity classes for membrane systems will be discussed, and the resulting hierarchy will be compared with the usual hierarchy of complexity classes, mainly through simulations of Turing Machines by (uniform families of) membrane systems with active membranes.