Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An algorithmic approximation of the infimum reachability probability for
  Probabilistic Finite Automata   Given a Probabilistic Finite Automata (PFA), a set of states S, and an error
threshold e > 0, our algorithm approximates the infimum probability
(quantifying over all infinite words) that the automata reaches S. Our result
contrasts with the known result that the approximation problem is undecidable
if we consider the supremum instead of the infimum. Since we study the
probability of reaching a set of states, instead of the probability of ending
in an accepting state, our work is more related to model checking than to
formal languages.

22
The categories of this paper are: chao-dyn
32
The categories of this paper are: atom-ph
27
The categories of this paper are: comp-gas
7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin
3
The categories of this paper are: physics
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
6
The categories of this paper are: astro-ph
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int
28
The categories of this paper are: alg-geom
25
The categories of this paper are: patt-sol