HYPERGRAPH AUTOMATA: A THEORETICAL MODEL FOR PATTERNED SELF-ASSEMBLY

DOI10.1142/S0129054114400048zbMath1360.68564arXiv1302.2840OpenAlexW2754500190MaRDI QIDQ2929627

Steffen Kopecki, Lila Kari, Amirhossein Simjour

Publication date: 14 November 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.2840

Mathematics Subject Classification ID

Hypergraphs (05C65) Formal languages and automata (68Q45) Combinatorial aspects of tessellation and tiling problems (05B45)

Cites Work

• Some properties of two-dimensional on-line tessellation acceptors
• Tile rewriting grammars and picture languages
• 3-Color Bounded Patterned Self-assembly

This page was built for publication: HYPERGRAPH AUTOMATA: A THEORETICAL MODEL FOR PATTERNED SELF-ASSEMBLY