5 citations · 8 across the 7 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2023
Regular Separability in Büchi VASS
Pascal Baumann, Roland Meyer, Georg Zetzsche
We study the (-)regular separability problem for Büchi VASS languages: Given two Büchi VASS with languages and , check whether there is a regular language that fully…
cs.FL2023★ 2 cited
Unboundedness problems for machines with reversal-bounded counters
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi +4
We consider a general class of decision problems concerning formal languages, called ``(one-dimensional) unboundedness predicates'', for automata that feature reversal-bounded coun…
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…