Simulation of universal gates on P system using catalysts
by R.S. Barkavi; P. Helen Chandra
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 7, No. 1, 2019

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.

Online publication date: Mon, 10-Feb-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com