Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Alternating tree automata

In automata theory, an alternating tree automaton is an extension of nondeterministic tree automaton as same as alternating finite automaton extends… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2021
2021
We study alternating automata with qualitative semantics over infinite binary trees: Alternation means that two opposing players… Expand
2009
2009
In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that… Expand
  • figure 1
2009
2009
For deterministic tree automata, classical hierarchies, like Mostowski-Rabin (or index) hierarchy, Borel hierarchy, or Wadge… Expand
  • figure 1
  • figure 2
Highly Cited
2006
Highly Cited
2006
This paper addresses the problem of synthesizing an asynchronous system from a temporal specification. We show that the cost of… Expand
Highly Cited
2006
Highly Cited
2006
  • Nir Piterman
  • 21st Annual IEEE Symposium on Logic in Computer…
  • 2006
  • Corpus ID: 14122357
In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states… Expand
2001
2001
  • J. Zappe
  • Automata, Logics, and Infinite Games
  • 2001
  • Corpus ID: 31764824
The modal μ-calculus is a logic that combines simple modal operators with fixed point operators to provide a form of recursion… Expand
2001
2001
  • D. Kirsten
  • Automata, Logics, and Infinite Games
  • 2001
  • Corpus ID: 8598042
Since Buchi’s work in 1960 [17], automata play an important role in logic. Numerous different notions of automata provide… Expand
Highly Cited
2000
Highly Cited
2000
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model… Expand
Highly Cited
2000
Highly Cited
2000
In program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system… Expand
Highly Cited
1995
Highly Cited
1995
Abstract We give a proof that alternating tree automata can be simulated by nondeterministic tree automata which yields new… Expand