The $z$-Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings

Details The $z$-Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings The $z$-Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings

2010-11-06

arxiv.org/abs/1011.1578v1

Computer Science

Symbolic Computation

7 pages

Scientific paper

A nonhomogeneous system of linear recurrence equations can be recognized by an automaton $\mathcal{A}$ over a one-letter alphabet $A = \{z\}$. Conversely, the automaton $\mathcal{A}$ generates precisely this nonhomogeneous system of linear recurrence equations. We present the solutions of these systems and apply the $z$-transform to these solutions to obtain their series representation. Finally, we show some results that simplify the series representation of the $z$-transform of these solutions. We consider single systems as well as the composition of two systems.

Affiliated with

Also associated with

No associations

Rating

The $z$-Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The $z$-Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The $z$-Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-699821