The Parameterized Complexity of Chosen Problems for Finite Automata on Trees

Agata Barecka, Witold Charatonik. The Parameterized Complexity of Chosen Problems for Finite Automata on Trees. In Adrian Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide, editors, Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings. Volume 6638 of Lecture Notes in Computer Science, pages 129-141, Springer, 2011. [doi]

Abstract

Abstract is missing.