AER
发表于 2025-4-1 02:16:26
http://reply.papertrans.cn/95/9413/941201/941201_61.png
松软
发表于 2025-4-1 06:07:46
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.
难理解
发表于 2025-4-1 12:49:54
,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.