Anzeige
Erschienen in:
01.06.2015
Staged self-assembly and polyomino context-free grammars
Erschienen in: Natural Computing | Ausgabe 2/2015
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Previous work by Demaine et al. (Nat Comput 6937:100–114, 2012) developed a strong connection between smallest context-free grammars and staged self-assembly systems for one-dimensional strings and assemblies. We extend this work to two-dimensional polyominoes and assemblies, comparing staged self-assembly systems to a natural generalization of context-free grammars we call polyomino context-free grammars (PCFGs). We achieve nearly optimal bounds on the largest ratios of the smallest PCFG and staged self-assembly system for a given polyomino with \(n\) cells. For the ratio of PCFGs over assembly systems, we show that the smallest PCFG can be an \(\varOmega (n/\log ^3{n})\)-factor larger than the smallest staged assembly system, even when restricted to square polyominoes. For the ratio of assembly systems over PCFGs, we show that the smallest staged assembly system is never more than a \(O(\log {n})\)-factor larger than the smallest PCFG and is sometimes an \(\varOmega (\log {n}/\log \log {n})\)-factor larger.