3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.FL2020
Alternating Tree Automata with Qualitative Semantics
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot +7
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 r…
cs.LO2019★ 3 cited
Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable
Raphaël Berthon, Emmanuel Filiot, Shibashis Guha +5
We prove that the theory of Monadic Second-Order logic (MSO) of the infinite binary tree extended with qualitative path-measure quantifier is undecidable. This quantifier says that…