Discounted Properties of Probabilistic Pushdown Automata
| Authors | |
|---|---|
| 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 | |
| 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: |