Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
The continuous Skolem-Pisot problem
Theoretical Computer Science
Note: The signs of three-term recurrence sequences
Discrete Applied Mathematics
Hi-index | 0.05 |
We give a decision method for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by u"n=au"n"-"1+bu"n"-"2 has only nonnegative terms.