Theorietage der Gesellschaft fur Informatik in Speyer 2015-Special Issue

被引:0
|
作者
Fernau, Henning [1 ]
机构
[1] Univ Trier, Informat Wissensch, FB 4, D-54296 Trier, Germany
来源
ALGORITHMS | 2016年 / 9卷 / 04期
关键词
formal languages; parsing; tree automata; NP-hardness; parameterized complexity;
D O I
10.3390/a9040064
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页数:2
相关论文
共 19 条