当前位置: X-MOL 学术arXiv.cs.FL › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Glushkov's construction for functional subsequential transducers
arXiv - CS - Formal Languages and Automata Theory Pub Date : 2020-08-05 , DOI: arxiv-2008.02239
Aleksander Mendoza-Drosik

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 $\epsilon$-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.

中文翻译:

Glushkov 的功能性后续换能器的构造

Glushkov 的结构具有许多有趣的特性,当应用于换能器时,它们变得更加明显。本文力求展示该算法可能的扩展和优化的浪费范围。引入了特殊的正则表达式,可以有效地转换为无 $\epsilon$ 的函数后续加权有限状态转换器。生成的自动机非常紧凑,因为它们只包含原始表达式的每个符号(来自输入字母表)的一个状态,并且每个符号范围仅包含一个转换,无论有多大。这种紧凑的转换范围允许在自动机评估期间进行高效的二分搜索查找。这里介绍的所有方法和算法都用于实现多磁带传感器正则表达式的开源编译器。
更新日期:2020-09-23
down
wechat
bug