The Parameterized Complexity of Chosen Problems for Finite Automata on Trees [chapter]

Agata Barecka, Witold Charatonik
2011 Lecture Notes in Computer Science  
There are many decision problems in automata theory (including membership, emptiness, emptiness of intersection, inclusion and universality problems) that for some classes of tree automata are NP-hard. The study of their parameterized complexity allows us to find new bounds of their non-polynomial time algorithmic behaviors. We present results of such a study for classical tree automata (TA), rigid tree automata (RTA), tree automata with global equality and disequality (TAGED) and t-DAG automata.
doi:10.1007/978-3-642-21254-3_9 fatcat:of2rl2ihu5bvlowun3ho36w72q