The parameterized complexity of chosen problems for finite automata on trees

Authors:
Agata Barecka;Witold Charatonik
Affiliations:
Institute of Mathematics, University of Wroclaw, Wroclaw, Poland;Institute of Computer Science, University of Wroclaw, Wroclaw, Poland
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 9
Cited 1

Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Rigid Tree Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Closure properties and decision problems of dag automata

Information Processing Letters
Set constraints with projections

Journal of the ACM (JACM)
The Emptiness Problem for Tree Automata with Global Constraints

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
The parameterized complexity of chosen problems for finite automata on trees

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Parameterized Complexity

Parameterized Complexity

The parameterized complexity of chosen problems for finite automata on trees

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

here 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 NPhard. 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.