当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
From Two-Way Transducers to Regular Function Expressions
International Journal of Foundations of Computer Science ( IF 0.8 ) Pub Date : 2020-10-05 , DOI: 10.1142/s0129054120410087
Nicolas Baudru 1 , Pierre-Alain Reynier 1
Affiliation  

Transducers constitute a fundamental extension of automata. The class of regular word functions has recently emerged as an important class of word-to-word functions, characterized by means of (functional, or unambiguous, or deterministic) two-way transducers, copyless streaming string transducers, and MSO-definable graph transformations. A fundamental result in language theory is Kleene’s Theorem, relating finite state automata and regular expressions. Recently, a set of regular function expressions has been introduced and used to prove a similar result for regular word functions, by showing its equivalence with copyless streaming string transducers. In this paper, we propose a direct, simplified and effective translation from unambiguous two-way transducers to regular function expressions extending the Brzozowski and McCluskey algorithm. In addition, our approach allows us to derive a subset of regular function expressions characterizing the (strict) subclass of functional sweeping transducers.

中文翻译:

从双向传感器到正则函数表达式

传感器构成自动机的基本扩展。常规词函数类最近已成为一类重要的词对词函数,其特征在于(功能性、或明确性或确定性)双向转换器、无副本流字符串转换器和 MSO 可定义的图形转换. 语言理论的一个基本结果是克林定理,将有限状态自动机和正则表达式联系起来。最近,一组正则函数表达式被引入并用于证明正则词函数的类似结果,通过显示其与无副本流字符串转换器的等价性。在本文中,我们提出了一种从明确的双向换能器到扩展 Brzozowski 和 McCluskey 算法的正则函数表达式的直接、简化和有效的转换。
更新日期:2020-10-05
down
wechat
bug