University of Oxford Logo University of OxfordDepartment of Computer Science - Home
On Facebook
Facebook
Follow us on twitter
Twitter
Linked in
Linked in
Flickr
Flickr
Google plus
Google plus
Digg
Digg
Pinterest
Pinterest
Stumble Upon
Stumble Upon

Oxford Quantum Talks Archive

Decision problems for probabilistic and quantum automata

Ben Worrell, University of Oxford
Seminars, May 2010, University of Oxford

In this talk we will survey decidability questions in the language theory of probabilistic and quantum finite automata. We will consider language equivalence for probabilistic automata as well as decidability and undecidability results for various versions of the threshold problem for probabilistic and quantum automata. If time permits we will discuss some applications of these results to probabilistic verification.

[video] [streaming video]