Parameterized complexity of basic decision problems for tree automata (Q2855747)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6217932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of basic decision problems for tree automata |
scientific article; zbMATH DE number 6217932 |
Statements
Parameterized complexity of basic decision problems for tree automata (English)
0 references
22 October 2013
0 references
classical tree automata
0 references
rigid tree automata
0 references
tree automata with global equality and disequality
0 references
t-DAG automata
0 references
parameterized complexity theory
0 references
0 references
0.9416658282279968
0 references
0.7687395215034485
0 references
0.7659860253334045
0 references
