作为计算模型的矩阵图文法
Matrix Graph Grammars as a Model of Computation
摘要:
矩阵图文法(MGG)是研究图动力学的一种新方法([15])。在目前的贡献,我们把MGG作为一个正式的语法和计算模型,这是一个必要的步骤,在更雄心勃勃的计划,通过MGG处理复杂性理论。我们还研究了它与其他著名的模型,如图灵机(TM)和布尔电路(BC)以及非确定性的关系。作为副作用,所有可用于MGG的技术都可以应用于TM和BC。
英文摘要:
Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of tackling complexity theory through MGG. We also study its relation with other well-known models such as Turing machines (TM) and Boolean circuits (BC) as well as non-determinism. As a side effect, all techniques available for MGG can be applied to TMs and BCs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。