Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,758 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Alternating finite automaton
Automata theory
Nondeterministic finite automaton
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Analysis of Logic Programs Using Regular Tree Languages - (Extended Abstract)
J. Gallagher
International Workshop/Symposium on Logic-based…
2011
Corpus ID: 28912849
The field of finite tree automata provides fundamental notations and tools for reasoning about sets of terms called regular or…
Expand
2010
2010
Model Checking Temporal-Epistemic Logic Using Tree Automata
F. Belardinelli
,
Andrew V. Jones
,
A. Lomuscio
2010
Corpus ID: 18834199
We introduce an automata-theoretic approach for the verification of multi-agent systems. We present a translation between…
Expand
2009
2009
On the Borel Inseparability of Game Tree Languages
S. Hummel
,
H. Michalewski
,
D. Niwinski
Symposium on Theoretical Aspects of Computer…
2009
Corpus ID: 51747146
The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness…
Expand
2008
2008
ON THE BOREL INSEPARABILITY OF GAME TREE
Languagesszczepan Hummel
,
H. Michalewski
,
Damian Niwi
2008
Corpus ID: 43470766
1 Fa ulty of Mathemati s, Informati s, and Me hani s Warsaw University, Poland E-mail address: {shummel,henrykm,niwinski} mimuw…
Expand
2006
2006
Determinizing Alternating Tree Automata, and Models ?
J. Goubault-Larrecq
2006
Corpus ID: 3152505
While alternating or non-deterministic tree automata are syntax (e.g., clause sets), complete deterministic automata are best…
Expand
2006
2006
Synthesis of Asynchronous Systems
Sven Schewe
,
B. Finkbeiner
2006
Corpus ID: 268109341
This paper addresses the problem of synthesizing an asynchronous system from a temporal specification. We show that the cost of…
Expand
2001
2001
Efficient Model Checking Via Büchi Tableau Automata
Girish Bhat
,
R. Cleaveland
,
Alex Groce
International Conference on Computer Aided…
2001
Corpus ID: 14802029
This paper describes an approach to engineering efficient model checkers that are generic with respect to the temporal logic in…
Expand
2001
2001
Efficient Model Checking via B ¨ Uchi Tableau Automata
Girish Bhat
,
R. Cleaveland
,
Alex Groce
2001
Corpus ID: 264207500
This paper describes an approach to engineering efficient model checkers that are generic with respect to the temporal logic in…
Expand
2000
2000
Decision Procedures for Inductive Boolean Functions based on Alternating Automata
Abdelwaheb Ayari
,
David Basin
,
Felix Klaedtke
2000
Corpus ID: 267945168
1989
1989
Pushdown Automata on Infinite Trees and Omega-Kleene closure of Context-Free Tree Sets
A. Saoudi
International Symposium on Mathematical…
1989
Corpus ID: 8621394
This theory has been extended to infinite trees ([II], [16], [17], [19], [22], [23], [25], [26], [27], [34]). In [23], M. O…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE