76 search results - page 1 / 16 » Weak Alternating Automata and Tree Automata Emptiness |
STOC
1998
ACM
13 years 8 months ago
1998
ACM
IPL
2002
13 years 4 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
IANDC
2007
13 years 4 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
FCT
2007
Springer
13 years 10 months ago
2007
Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...