14 citations · 86 across the 43 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.FL2014★ 7 cited
A Characterization for Decidable Separability by Piecewise Testable Languages
Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen +2
The separability problem for word languages of a class by languages of a class asks, for two given languages and from , whether the…
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…
cs.FL2014
The monoid of queue actions
Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and termi…