Abstract
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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Barecka, A., & Charatonik, W. (2011). The parameterized complexity of chosen problems for finite automata on trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 129–141). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
