Titlebook: Unconventional Computation and Natural Computation; 21st International C Da-Jung Cho,Jongmin Kim Conference proceedings 2024 The Editor(s)

AER

松軟

Bonding Grammars,and hyperedge replacement grammars proving that the classes of languages generated by them are incomparable. Secondly, we prove that bonding grammars naturally generalise regular sticker systems. Finally, we prove that the membership problem for bonding grammars is NP-complete.

難理解

,Self-assembly of?Patterns in?the?Abstract Tile Assembly Model,e surfaces of square assemblies. Finally, we demonstrate an exponential gap in tile type complexity of self-assembling an infinite series of patterns between systems restricted to one plane versus those allowed two planes.