Abstract
A new generative model for simulation of universal gates with P system is proposed using catalysts. The simulation is done with P system with symbol objects, context free rewriting rules, features like mobile catalysts and weak priorities. The simulation of twin switch is shown as an application, and the half adder and full adder are shown as the theorems.
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 callMore From: International Journal of Artificial Intelligence and Soft Computing
Disclaimer: 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.
