Alternating tree automata

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

Topic mentions per year

Topic mentions per year

1983-2017
02419832017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
μ-Calculus and automata on infinite trees are complementary ways of describing infinite tree languages. The correspondence… (More)
Is this relevant?
2013
2013
We consider the emptiness problem for alternating tree automata, with two acceptance semantics: classical (all branches are… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
We introduce a novel automata-theoretic approach for the verification of multi-agent systems. We present epistemic alternating… (More)
Is this relevant?
2009
2009
For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge… (More)
  • figure 1
  • figure 2
Is this relevant?
2009
2009
μ-Calculus and automata on infinite trees are complementary ways of describing infinite tree languages. The correspondence… (More)
Is this relevant?
2006
2006
In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
2 From Modal -Calculus to Alternating Tree Automata 4 2.1 Modal -Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2… (More)
Is this relevant?
2000
2000
We show how alternating automata provide decision procedures for the equality of inductively de3ned Boolean functions and present… (More)
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… (More)
Is this relevant?
1983
1983
 
Is this relevant?