矩阵图文法与单调复逻辑
Matrix Graph Grammars and Monotone Complex Logics
摘要:
图变换涉及到通过规则对图进行操作。传统上,图文法是使用范畴论的技术来研究的。在以前的作品中,我们介绍了矩阵图文法(MGGs)作为一个纯粹的代数方法的研究图文法和图动力学,通过其邻接矩阵的图形表示的基础上。MGG已成功地应用于规则序列的适用性、序列化和可达性等问题,提供了新的分析技术,推广和改进了以前的结果。我们的下一个目标是概括MGG,以便从某些语法的“动态”中接近计算复杂性理论和图的“静态”属性。在目前的工作中,我们开始建立MGGs和复杂性之间的桥梁,通过引入我们所谓的“单调复杂逻辑”,它允许建立一个(双射)MGGs和复杂的分析之间的联系。我们使用这种逻辑来重铸的配方和基本积木MGGs更适当的几何和分析概念(标量产品,规范,距离)。MGG规则也可以通过运算符解释为复数。有趣的是,他们定义的子集可以被描述为谢尔宾斯基垫片。
英文摘要:
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previous works, we introduced Matrix Graph Grammars (MGGs) as a purely algebraic approach for the study of graph grammars and graph dynamics, based on the representation of graphs by means of their adjacency matrices. MGGs have been succesfully applied to problems such as applicability of rule sequences, sequentialization and reachability, providing new analysis techniques and generalizing and improving previous results. Our next objective is to generalize MGGs in order to approach computational complexity theory and "static" properties of graphs out of the "dynamics" of certain grammars. In the present work, we start building bridges between MGGs and complexity by introducing what we call "Monotone Complex Logic", which allows establishing a (bijective) link between MGGs and complex analysis. We use this logic to recast the formulation and basic building blocks of MGGs as more proper geometric and analytic concepts (scalar products, norms, distances). MGG rules can also be interpreted - via operators - as complex numbers. Interestingly, the subset they define can be characterized as the Sierpinski gasket.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。