发现一种实际学习带交错的受限单次出现正则表达式的算法
Discovering an Algorithm Actually Learning Restricted Single Occurrence Regular Expression with Interleaving
摘要：
最近的一篇论文提出了一个算法iSOIRE，它结合了单次出现自动机（SOA）和最大独立集（MIS）来学习一个子类的带交错的单次出现正则表达式（SOIRES），并声称学习的表达式是SOIRE，它对交错的使用没有限制。但在实际中，学习后的表达式在使用交错时仍有许多限制，即使是Kleene-star或interation也是如此，即学习后的表达式不是SOIRE，我们通过实例证明了这一点。本文首先给出了iSOIRE算法的基本概念，然后对错误进行了分析，最后给出了iSOIRE学习的正确结果。我们的理论分析表明，由iSOIRE导出的结果属于SOIRE的一个子类。
英文摘要：
A recent paper proposed an algorithm iSOIRE, which combines single-occurrence automaton (SOA) and maximum independent set (MIS) to learn a subclass single-occurrence regular expressions with interleaving (SOIREs) and claims the learnt expression is SOIRE, which has unrestricted usage for interleaving. However, in reality, the learnt expression still has many restrictions for using interleaving, even does for Kleene-star or interation, i.e, the learnt expression is not an SOIRE, we prove that by examples. In this paper, for the algorithm iSOIRE, we first give the basic notions, then provide analyses about incorrectness, finally present the correct result learnt by iSOIRE. Our theoretical analyses demonstrate that the result derived by iSOIRE belongs to a subclass of SOIREs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
