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.
2020
2020
We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players… Expand
Is this relevant?
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
Is this relevant?
2009
2009
For deterministic tree automata, classical hierarchies, like Mostowski-Rabin (or index) hierarchy, Borel hierarchy, or Wadge… Expand
  • figure 1
  • figure 2
Is this relevant?
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
Is this relevant?
2001
2001
  • Júlia 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
Is this relevant?
2001
2001
  • Daniel 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
Is this relevant?
1999
1999
We introduce timed alternating tree automata as a natural extension of timed automata for the purpose of solving the model… Expand
Is this relevant?
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
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model… Expand
Is this relevant?
1985
1985
 
Is this relevant?