  In this paper, as an analogue of the integer case, we study detailedly the
period and the rank of the generalized Fibonacci sequence of polynomials over a
finite field modulo an arbitrary polynomial. We establish some formulas to
compute them, and we also obtain some properties about the quotient of the
period and the rank. We find that the polynomial case is much more complicated
than the integer case.
