@inproceedings{10.1007/978-3-540-89439-1_17,
Abstract = {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.},
Address = {Berlin, Heidelberg},
Author = {Br{\'a}zdil, Tom{\'a}{\v{s}} and Bro{\v{z}}ek, V{\'a}clav and Hole{\v{c}}ek, Jan and Ku{\v{c}}era, Anton{\'\i}n},
BookTitle = {Logic for Programming, Artificial Intelligence, and Reasoning},
Editor = {Cervesato, Iliano and Veith, Helmut and Voronkov, Andrei},
ISBN = {978-3-540-89439-1},
Pages = {230--242},
Publisher = {Springer Berlin Heidelberg},
Title = {Discounted Properties of Probabilistic Pushdown Automata},
Year = {2008},
date-added = {2022-12-27 08:45:55 +0100},
date-modified = {2022-12-27 08:45:55 +0100},
doi = {10.1007/978-3-540-89439-1_17}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A