منابع مشابه
On 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 recognizability, ge...
متن کامل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, genera...
متن کاملUniserial modules of generalized power series
Let R be a ring, M a right R-module and (S,≤) a strictly ordered monoid. In this paper we will show that if (S,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ S, then the module [[MS,≤]] of generalized power series is a uniserial right [[RS,≤]] ]]-module if and only if M is a simple right R-module and S is a chain monoid.
متن کاملCompositions of tree series transformations
Tree series transformations computed by bottom-up and top-down tree series transducers are called bottomup and top-down tree series transformations, respectively. (Functional) compositions of such transformations are investigated. It turns out that the class of bottom-up tree series transformations over a commutative and complete semiring is closed under left-composition with linear bottom-up t...
متن کاملTree-Series-to-Tree-Series Transformations
We investigate the tree-series-to-tree-series (ts-ts) transformation computed by tree series transducers. Unless the used semiring is complete, this transformation is, in general, not well-defined. In practice, many used semirings are not complete (like the probability semiring). We establish a syntactical condition that guarantees well-definedness of the ts-ts transformation in arbitrary commu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1994
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1994-1198451-0