Simulating Boolean Circuits with P Systems
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.
Unable to display preview. Download preview PDF.
- 1.Greenlaw, R., Hoover, H.J.: Parallel Computation, Algorithms and Theory of Computation Handbook. In: Atallah, M.J. (ed.). CRC Press, Boca Raton (1999)Google Scholar
- 2.Ogihara, M., Ray, A.: Simulating Boolean Circuits on a DNA Computer. Technical Report 631, Department of Computer Science, Rutgers University (1996)Google Scholar