Subject
General Computer Science,Theoretical Computer Science
Reference6 articles.
1. Recognisability for algebras of infinite trees;Blumensath;Theoretical Computer Science,2011
2. T. Colcombet, On Factorization Forests, Tech. Rep. hal-00125047, Irisa Rennes, 2007.
3. Automata, Logic, and Infinite Games;Grädel,2002
4. Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra;Muller;Theoretical Computer Science,1995
5. The monadic second order theory of order;Shelah;Annals of Mathematics,1975
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献