Rational Transformations of Formal Power Series

Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state machines. In this paper, motivated by codings of formal languages, we introduce and investigate two types of transformations for formal power series. We characterize when these transformations preserve rationality, generalizing the recent results of Zhang [16] to the formal power series setting. We show, for example, that the “square-root” operation, while preserving regularity for formal languages, preserves rationality for formal power series when the underlying semiring is commutative or locally finite, but not in general. Key Words: Formal power series, rational languages, recognizable languages, weighted finite automata.

• Type: Conference
• Year: 2001
• Where: ICALP
• Authors: Manfred Droste, Guo-Qiang Zhang
• Keywords: Formal Languages, Formal Power Series, ICALP 2001, Programming Languages, Recognizable Formal Power