扩展到多波浪线的正则表达式和有效的有限自动机构造
Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions
摘要：
已经设计了几种算法来将正则表达式转换为等价的有限自动机。最流行的构造之一，由于Glushkov和McNaughton和Yamada，是基于与表达式的线性化版本相关的第一，第一，最后和跟随集合（称为Glushkov函数）的计算。最近Mignot考虑了一个家庭的扩展表达式称为扩展到多波浪线酒吧正则表达式（EmtbRE），他表明，在某些限制下，Glushkov函数可以定义为EmtbRE。在本文中，我们提出了一个算法，有效地计算Glushkov函数的一个不受限制的EmtbRE。我们的方法是基于一个递归的定义的语言与EmtbRE启发的事实，即最坏情况下的时间复杂度的EmtbRE到自动机的转换是相关的最坏情况下的时间复杂度的计算的ESTFUNCTURE函数。最后，我们展示了如何扩展ZPC结构EmtbRE，这使我们能够适用于这个家庭的扩展表达式的有效结构的基础上，这种结构（特别是建设的c-连续自动机，位置自动机，以下自动机和方程自动机）。
英文摘要：
Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton and Yamada, is based on the computation of the Null, First, Last and Follow sets (called Glushkov functions) associated with a linearized version of the expression. Recently Mignot considered a family of extended expressions called Extended to multi-tilde-bar Regular Expressions (EmtbREs) and he showed that, under some restrictions, Glushkov functions can be defined for an EmtbRE. In this paper we present an algorithm which efficiently computes the Glushkov functions of an unrestricted EmtbRE. Our approach is based on a recursive definition of the language associated with an EmtbRE which enlightens the fact that the worst case time complexity of the conversion of an EmtbRE into an automaton is related to the worst case time complexity of the computation of the Null function. Finally we show how to extend the ZPC-structure to EmtbREs, which allows us to apply to this family of extended expressions the efficient constructions based on this structure (in particular the construction of the c-continuation automaton, the position automaton, the follow automaton and the equation automaton).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
