Parameterized complexity of basic decision problems for tree automata

There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of tree automata (TA). The study of their parameterized complexity allows us to find new bounds of their nonpolynomial time algorithmic behavio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 90; číslo 6; s. 1150 - 1170
Hlavní autoři: Charatonik, Witold, Chorowska, Agata
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Taylor & Francis 01.06.2013
Taylor & Francis Ltd
Témata:
Algorithms
Automation
classical tree automata
Complexity
Computer science
Mathematical analysis
Mathematical models
Parameter estimation
parameterized complexity theory
rigid tree automata
Signatures
t-DAG automata
Tantalum
Theory
tree automata with global equality and disequality
Trees
ISSN:0020-7160, 1029-0265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of tree automata (TA). The study of their parameterized complexity allows us to find new bounds of their nonpolynomial time algorithmic behaviours. We present results of such a study for classical TA, rigid tree automata, TA with global equality and disequality and t-DAG automata. As parameters we consider the number of states, the cardinality of the signature, the size of the term or the t-dag and the size of the automaton.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160.2012.762451