9 citations · 25 across the 22 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.FL2017
The Emptiness Problem for Valence Automata over Graph Monoids
Georg Zetzsche
This work studies which storage mechanisms in automata permit decidability of the emptiness problem. The question is formalized using valence automata, an abstract model of automat…
math.GR2017
Knapsack Problems for Wreath Products
Moses Ganardi, Daniel König, Markus Lohrey +1
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns ou…