Simulating Boolean Circuits with P Systems

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ceterchi, Rodica, Sburlan, Dragoş
Format: Buchkapitel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Boolean Function
Computer science
control theory
systems
Exact sciences and technology
Input Symbol
Logical Gate
Mathematical Linguistics
Software
Theoretical computing
Underlying Graph
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-24619-0_8