Abstract
One of the interesting applications of membrane computing is the ability to solve intractable problems in polynomial time. The existing variants with active membranes have several powerful features like polarizations, dissolution, evolution and communication rules as well as non-elementary membrane division. We propose a simple variant which uses elementary membrane division and communication only in the form of mobility of membranes. We show that this variant has \(\Sigma_2^P \cup \Pi_2^P\) as lower bound. This is the first known treatment of the complexity classes \(\Sigma_2^P\), \(\Pi_2^P\) using active membranes without the features of polarizations, non elementary membrane division.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
