14 citations · 86 across the 43 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.FL2013★ 4 cited
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
P. Buckheister, Georg Zetzsche
Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is co…
cs.FL2013
Silent Transitions in Automata with Storage
Georg Zetzsche
We consider the computational power of silent transitions in one-way automata with storage. Specifically, we ask which storage mechanisms admit a transformation of a given automato…
math.GR2013★ 3 cited
Rational Subsets and Submonoids of Wreath Products
Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
It is shown that membership in rational subsets of wreath products H \wr V with H a finite group and V a virtually free group is decidable. On the other hand, it is shown that ther…