Affiliation:
1. LIGM (CNRS & Université Paris Est), France
2. LIAFA (CNRS & Université Paris Diderot - Paris 7) & LIGM (CNRS & Université Paris Est), France
3. LIAFA (CNRS & Université Paris Diderot - Paris 7), France
Abstract
We study finite automata running over infinite binary trees. A run of such an automaton over an input tree is a tree labeled by control states of the automaton: the labeling is built in a top-down fashion and should be consistent with the transitions of the automaton. A branch in a run is accepting if the ω-word obtained by reading the states along the branch satisfies some acceptance condition (typically an ω-regular condition such as a Büchi or a parity condition). Finally, a tree is accepted by the automaton if there exists a run over this tree in which
every
branch is accepting.
In this article, we consider two relaxations of this definition, introducing a qualitative aspect. First, we relax the notion of accepting run by allowing a negligible set (in the sense of measure theory) of nonaccepting branches. In this qualitative setting, a tree is accepted by the automaton if there exists a run over this tree in which
almost every
branch is accepting. This leads to a new class of tree languages,
qualitative tree languages
. This class enjoys many good properties: closure under union and intersection (but not under complement), and emptiness is decidable in polynomial time. A dual class,
positive tree languages
, is defined by requiring that an accepting run contains a non-negligeable set of branches.
The second relaxation is to replace the existential quantification (a tree is accepted if there exists some accepting run over the input tree) with a probabilistic quantification (a tree is accepted if almost every run over the input tree is accepting). For the run, we may use either classical acceptance or qualitative acceptance. In particular, for the latter, we exhibit a tight connection with partial observation Markov decision processes. Moreover, if we additionally restrict operation to the Büchi condition, we show that it leads to a class of probabilistic automata on infinite trees enjoying a decidable emptiness problem. To our knowledge, this is the first positive result for a class of probabilistic automaton over infinite trees.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Probabilistic Rabin Tree Theorem*;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Alternating Tree Automata with Qualitative Semantics;ACM Transactions on Computational Logic;2021-01-22
3. How Good Is a Strategy in a Game with Nature?;ACM Transactions on Computational Logic;2020-07-31
4. Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
5. Numerical simulation of temporarily plugging staged fracturing (TPSF) based on cohesive zone method;Computers and Geotechnics;2020-05