Highly Influenced

# The continuous Skolem-Pisot problem

@article{Bell2010TheCS, title={The continuous Skolem-Pisot problem}, author={Paul Bell and Jean-Charles Delvenne and Rapha{\"e}l M. Jungers and Vincent D. Blondel}, journal={Theor. Comput. Sci.}, year={2010}, volume={411}, pages={3625-3634} }

- Published 2010 in Theor. Comput. Sci.
DOI:10.1016/j.tcs.2010.06.005

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the nonnegativity problem is NP-hard in general and we show that the presence of a zero is decidable for several subcases, including instances of depth two or less, although the decidability in general is left open. The problems may also be stated as reachability… CONTINUE READING

Highly Cited

This paper has 21 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

13 Citations

29 References

Similar Papers