Skip to search formSkip to main contentSkip to account menu

Alternating tree automata

In automata theory, an alternating tree automaton is an extension of nondeterministic tree automaton as same as alternating finite automaton extends… 
Wikipedia (opens in a new tab)

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… 
2010
2010
Highly Cited
2006
Highly Cited
2006
  • N. Piterman
  • Logic in Computer Science
  • 2006
  • Corpus ID: 14122357
In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states… 
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… 
Highly Cited
2006
Highly Cited
2006
The synthesis of reactive systems requires the solution of two-player games on graphs with ω-regular objectives. When the… 
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… 
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… 
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… 
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…