P A Lindsay
-
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)