1 research outputs found
The -Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings
A nonhomogeneous system of linear recurrence equations can be recognized by
an automaton over a one-letter alphabet . Conversely,
the automaton generates precisely this nonhomogeneous system of
linear recurrence equations. We present the solutions of these systems and
apply the -transform to these solutions to obtain their series
representation. Finally, we show some results that simplify the series
representation of the -transform of these solutions. We consider single
systems as well as the composition of two systems.Comment: 7 page