Under the auspices of the Computational Complexity Foundation (CCF)
We give a method to decide whether or not anordinary finite order linear recurrence with constant, rationalcoefficients ever generates zero.
