Concepedia

Reachability problems for Markov chains

S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell

Information Processing Letters · 2014 · 49 citations · 11 references

DOI

Concepts

References

11

Probabilistic automata

Michael O. Rabin · Information and Control · 1963 · 627 citations

Polynomial-time algorithm for the orbit problem

Ramachandran Kannan, R.J. Lipton · Journal of the ACM · 1986 · 94 citations · Full text

, , +10

Generalized automata and stochastic languages

Paavo Turakainen · Proceedings of the American Mathematical Society · 1969 · 92 citations

, , +12

Positivity problems for low-order linear recurrence sequences

Joël Ouaknine, James Worrell · arXiv (Cornell University) · 2014 · 59 citations · Full text

, , +12

The presence of a zero in an integer linear recurrent sequence is NP-hard to decide

Vincent D. Blondel, Natacha Portier · Linear Algebra and its Applications · 2002 · 56 citations

, , +6