Alternating Tree Automata with Qualitative Semantics

02/10/2020
by   Raphaël Berthon, et al.
0

We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a run, and the qualitative semantics says that a run of the automaton is accepting if almost all branches of the run are accepting. In this paper we prove a positive and a negative result for the emptiness problem of alternating automata with qualitative semantics. The positive result is the decidability of the emptiness problem for the case of Büchi acceptance condition. An interesting aspect of our approach is that we do not extend the classical solution for solving the emptiness problem of alternating automata, which first constructs an equivalent non-deterministic automaton. Instead, we directly construct an emptiness game making use of imperfect information. The negative result is the undecidability of the emptiness problem for the case of co-Büchi acceptance condition. This result has two direct consequences: the undecidability of monadic second-order logic extended with the qualitative path-measure quantifier, and the undecidability of the emptiness problem for alternating tree automata with non-zero semantics, a recently introduced probabilistic model of alternating tree automata.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/14/2019

Monadic Second Order Logic with Path-Measure Quantifier is Undecidable

We prove that the theory of monadic second order logic (MSO) of the infi...
research
11/10/2020

Inferring Symbolic Automata

We study the learnability of symbolic finite state automata, a model sho...
research
04/07/2018

Coalgebraic Determinization of Alternating Automata

Coalgebra is a currently quite active field, which aims to look at gener...
research
07/30/2020

Reasoning about strategies on collapsible pushdown arenas with imperfect information

Strategy Logic with imperfect information (SLiR) is a very expressive lo...
research
04/13/2018

Constructive Analysis of S1S and Büchi Automata

We study S1S and Büchi automata in the constructive type theory of the C...
research
06/20/2022

From Spot 2.0 to Spot 2.10: What's New?

Spot is a C ++ 17 library for LTL and ω-automata manipulation, with comm...
research
05/07/2023

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism

We study transformations of automata and games using Muller conditions i...

Please sign up or login with your details

Forgot password? Click here to reset