函数连续换能器的Glushkov结构
Glushkov's construction for functional subsequential transducers
摘要:
Glushkov的结构有许多有趣的性质,当应用于换能器时,它们变得更加明显。本文致力于展示这种算法的可能扩展和优化的范围。介绍了正则表达式的特殊形式,它可以有效地转换为无$ε$的泛函序贯加权有限状态变换器。产生的自动机是非常紧凑的,因为它们只包含一个状态的每个符号(从输入字母表)的原始表达和只有一个过渡的每个范围的符号,无论有多大。这种紧凑化的转换范围允许在自动机评估期间进行有效的二进制搜索查找。本文提出的方法和算法已用于实现多带转换器正则表达式的开源编译器。
英文摘要:
Glushkov's construction has many interesting properties and they become even more evident when applied to transducers. This article strives to show the wast range of possible extensions and optimisations for this algorithm. Special flavour of regular expressions is introduced, which can be efficiently converted to $ε$-free functional subsequential weighted finite state transducers. Produced automata are very compact, as they contain only one state for each symbol (from input alphabet) of original expression and only one transition for each range of symbols, no matter how large. Such compactified ranges of transitions allow for efficient binary search lookup during automaton evaluation. All the methods and algorithms presented here were used to implement open-source compiler of regular expressions for multitape transducers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。