布尔自动机网络的最短轨线与可逆性
Shortest Trajectories and Reversibility in Boolean Automata Networks
摘要:
本研究报告探讨的问题如下:两个配置之间的最短轨迹,或者一个配置和吸引子之间的最短轨迹何时需要改变一个自动机的状态几次?
英文摘要:
The question this research report explores is the following: when does a shortest trajectory between two configurations, or between one configuration and an attractor need to change several times the state of one automaton?
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。