Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Greenlaw, R., Hoover, H.J.: Parallel Computation, Algorithms and Theory of Computation Handbook. In: Atallah, M.J. (ed.). CRC Press, Boca Raton (1999)
Ogihara, M., Ray, A.: Simulating Boolean Circuits on a DNA Computer. Technical Report 631, Department of Computer Science, Rutgers University (1996)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Paun, G., Rozenberg, G.: A Guide to Membrane Computing. Theoretical Computer Science 287(1), 73–100 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ceterchi, R., Sburlan, D. (2004). Simulating Boolean Circuits with P Systems. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2003. Lecture Notes in Computer Science, vol 2933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24619-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24619-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20895-2
Online ISBN: 978-3-540-24619-0
eBook Packages: Springer Book Archive