有向图的变异--对应的正则表达式及其生成的复杂性
Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation
摘要：
有向图（DG），解释为状态转换图，传统上用于表示有限状态自动机（FSA）。在形式语言的上下文中，FSA和正则表达式（RE）是等价的，因为它们分别接受和生成类型3（正则）语言。本文在前人工作的基础上，分析了图形操作对相应RE的影响。在这个目前的开始阶段，我们假设所考虑的DG不包含任何循环。通过删除或插入节点或弧来执行图形操作。这些基本算子的组合和/或多个应用使得能够实现DG（和相应的RE）的各种各样的变换，这些变换可以被视为原始DG（和相应的RE）的突变体。DG是流行的建模复杂的系统，但他们很容易成为棘手的，如果所考虑的系统是复杂的和/或大的。在这种情况下，我们建议切换到相应的RE，以受益于其紧凑的格式建模和代数运算的分析。该研究结果对突变检测具有很大的潜在意义。
英文摘要：
Directed graphs (DG), interpreted as state transition diagrams, are traditionally used to represent finite-state automata (FSA). In the context of formal languages, both FSA and regular expressions (RE) are equivalent in that they accept and generate, respectively, type-3 (regular) languages. Based on our previous work, this paper analyzes effects of graph manipulations on corresponding RE. In this present, starting stage we assume that the DG under consideration contains no cycles. Graph manipulation is performed by deleting or inserting of nodes or arcs. Combined and/or multiple application of these basic operators enable a great variety of transformations of DG (and corresponding RE) that can be seen as mutants of the original DG (and corresponding RE). DG are popular for modeling complex systems; however they easily become intractable if the system under consideration is complex and/or large. In such situations, we propose to switch to corresponding RE in order to benefit from their compact format for modeling and algebraic operations for analysis. The results of the study are of great potential interest to mutation testing.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
