关于形式幂级数的商
On Quotients of Formal Power Series
摘要:
商是形式语言的一种基本运算,在构造最小确定有限自动机和泛自动机中起着关键作用。本文将该运算推广到形式幂级数,并系统地研究了它在加权自动机研究中的应用。特别是,我们定义了两个商操作的正式幂级数,符合计算时,由一个字。我们将第一个操作称为(左或右)\emph{quotient},将第二个操作称为(左或右)\emph{residual}。为了支持余元和剩余的定义,底层半环被限制为完全半环或完全c-半环。在形式幂级数的情况下,得到了类似于经典情况的代数性质。此外,我们还证明了正则级数和加权上下文无关级数的闭包性质,在幂次项和残差项下,与形式语言中的闭包性质相似。使用这些操作,我们为每个形式幂级数$A$定义两个加权自动机${\cal M}_A$和${\cal U}_A$。这两个加权自动机都接受$A$,而${\cal M}_A$是$A$的最小确定性加权自动机。${\cal U}_A$的普遍性是合理的,特别是,我们表明,${\cal M}_A$是一个子自动机的${\cal U}_A$。最后,本文给出了构造泛自动机的一种有效方法。
英文摘要:
Quotient is a basic operation of formal languages, which plays a key role in the construction of minimal deterministic finite automata (DFA) and the universal automata. In this paper, we extend this operation to formal power series and systemically investigate its implications in the study of weighted automata. In particular, we define two quotient operations for formal power series that coincide when calculated by a word. We term the first operation as (left or right) \emph{quotient}, and the second as (left or right) \emph{residual}. To support the definitions of quotients and residuals, the underlying semiring is restricted to complete semirings or complete c-semirings. Algebraical properties that are similar to the classical case are obtained in the formal power series case. Moreover, we show closure properties, under quotients and residuals, of regular series and weighted context-free series are similar as in formal languages. Using these operations, we define for each formal power series $A$ two weighted automata ${\cal M}_A$ and ${\cal U}_A$. Both weighted automata accepts $A$, and ${\cal M}_A$ is the minimal deterministic weighted automaton of $A$. The universality of ${\cal U}_A$ is justified and, in particular, we show that ${\cal M}_A$ is a sub-automaton of ${\cal U}_A$. Last but not least, an effective method to construct the universal automaton is also presented in this paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。