5 citations · 5 across the 2 of their papers we have counts for
2 papers
math.GR2016
The Complexity of Knapsack in Graph Groups
Markus Lohrey, Georg Zetzsche
Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem…
cs.FL2014★ 5 cited
Computing downward closures for stacked counter automata
Georg Zetzsche
The downward closure of a language of words is the set of all (not necessarily contiguous) subwords of members of . It is well known that the downward closure of any languag…