Discounted Properties of Probabilistic Pushdown Automata

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRÁZDIL Tomáš BROŽEK Václav HOLEČEK Jan KUČERA Antonín

Year of publication 2008
Type Article in Proceedings
Conference Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords Markov chains; discounting; pushdown automata
Description We show that several basic discounted properties of probabilistic pushdown automata related both to terminating and non-terminating runs can be efficiently approximated up to an arbitrarily small given precision.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.