Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Markov Chains and Unambiguous Automata   Unambiguous automata are nondeterministic automata in which every word has at
most one accepting run. In this paper we give a polynomial-time algorithm for
model checking discrete-time Markov chains against $\omega$-regular
specifications represented as unambiguous automata. We furthermore show that
the complexity of this model checking problem lies in NC: the subclass of P
comprising those problems solvable in poly-logarithmic parallel time. These
complexity bounds match the known bounds for model checking Markov chains
against specifications given as deterministic automata, notwithstanding the
fact that unambiguous automata can be exponentially more succinct than
deterministic automata. We report on an implementation of our procedure,
including an experiment in which the implementation is used to model check LTL
formulas on Markov chains.

9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph
16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
37
The categories of this paper are: supr-con
18
The categories of this paper are: econ
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
19
The categories of this paper are: eess
31
The categories of this paper are: ao-sci
4
The categories of this paper are: cond-mat
0
The categories of this paper are: hep-ph