Hypergraph Contextual Grammars for Self-Assembling DNA Boolean Circuits Modelling

Contextual hypergraph grammars represent a generalization of contextual grammars by considering hypergraphs instead of strings as underlying data structures. These grammars are important for both computational and modeling capabilities especially for the newly emergent domain of self-assembling DNA structures. In this paper we show how starting from a given Boolean function, we construct a contextual hypergraph grammar able to model the self-assembling tile process that performs the corresponding computations