We propose a model for simulating Boolean circuits with P systems. The simulation is done in two steps, by first simulating the gates of such a circuit, and next by showing how these can be combined to obtain actual circuits. The type of P systems used is with symbol objects, context-free rewriting rules and some other features like mobile catalysts, weak priorities and promoters.
['Rodica Ceterchi', 'Dragoş Sburlan']
Simulating Boolean circuits with P systems