超图自动机：一种图案化自组装的理论模型
Hypergraph Automata: A Theoretical Model for Patterned Self-assembly
摘要：
图案化自组装是彩色瓷砖自组装以构建矩形彩色图案的过程。我们提出自组装（SA）超图自动机作为自动机理论模型的模式化自组装。我们研究了SA-超图自动机的计算能力，并表明，对于每一个可识别的图片语言，存在一个SA-超图自动机，接受这种语言。相反，我们证明，任何限制SA超图自动机，存在一个王瓷砖系统，可识别的图片语言的模型，接受相同的语言。SA-超图自动机优于Wang自动机的优点是它们不依赖于先验定义的扫描策略，
英文摘要：
Patterned self-assembly is a process whereby coloured tiles self-assemble to build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph automata as an automata-theoretic model for patterned self-assembly. We investigate the computational power of SA-hypergraph automata and show that for every recognizable picture language, there exists an SA-hypergraph automaton that accepts this language. Conversely, we prove that for any restricted SA-hypergraph automaton, there exists a Wang Tile System, a model for recognizable picture languages, that accepts the same language. The advantage of SA-hypergraph automata over Wang automata, acceptors for the class of recognizable picture languages, is that they do not rely on an a priori defined scanning strategy
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
