In mathematics and computer science, a rational series is a generalisation of the concept of formal power series over a ring to the case when the basic algebraic structure is no longer a ring but a semiring, and the indeterminates adjoined are not assumed to commute. They can be regarded as algebraic expressions of a formal language over a finite alphabet.
Let R be a semiring and A a finite alphabet.
A non-commutative polynomial over A is a finite formal sum of words over A. They form a semiring
R\langleA\rangle
A formal series is a R-valued function c, on the free monoid A*, which may be written as
\sum | |
w\inA* |
c(w)w.
The set of formal series is denoted
R\langle\langleA\rangle\rangle
c+d:w\mapstoc(w)+d(w)
c ⋅ d:w\mapsto\sumuvc(u) ⋅ d(v)
A non-commutative polynomial thus corresponds to a function c on A* of finite support.
In the case when R is a ring, then this is the Magnus ring over R.[1]
If L is a language over A, regarded as a subset of A* we can form the characteristic series of L as the formal series
\sumww
corresponding to the characteristic function of L.
In
R\langle\langleA\rangle\rangle
S*=\sumnSn
and formalised as
c*(w)=
\sum | |
u1u2 … un=w |
c(u1)c(u2) … c(un).
The rational operations are the addition and multiplication of formal series, together with iteration.A rational series is a formal series obtained by rational operations from
R\langleA\rangle.
K