Alternating tree automata
Semantic Scholar uses AI to extract papers important to this topic.
We study alternating automata with qualitative semantics over infinite binary trees: Alternation means that two opposing players… Expand In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that… Expand For deterministic tree automata, classical hierarchies, like Mostowski-Rabin (or index) hierarchy, Borel hierarchy, or Wadge… Expand This paper addresses the problem of synthesizing an asynchronous system from a temporal specification. We show that the cost of… Expand In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states… Expand The modal μ-calculus is a logic that combines simple modal operators with fixed point operators to provide a form of recursion… Expand Since Buchi’s work in 1960 , automata play an important role in logic. Numerous different notions of automata provide… Expand Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model… Expand In program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system… Expand Abstract We give a proof that alternating tree automata can be simulated by nondeterministic tree automata which yields new… Expand