Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue

Algorithms

Henning Fernau¹ 

[1] FB 4, Informatikwissenschaften, University of Trier, Universitätsring, 54296 Trier, Germany;

关键词: formal languages;    parsing;    tree automata;    NP-hardness;    parameterized complexity;   

DOI  :  10.3390/a9040064

来源: DOAJ

【 摘 要 】

We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.

【 授权许可】

Unknown