13 citations · 30 across the 14 of their papers we have counts for
17 papers
Reachability in Trace-Pushdown Systems
Chris Köcher, Dietrich Kuske
We consider the reachability relation of pushdown systems whose pushdown holds a Mazurkiewicz trace instead of just a word as in classical systems. Under two natural conditions on…
On Presburger arithmetic extended with non-unary counting quantifiers
Peter Habermehl, Dietrich Kuske
We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers…
Languages ordered by the subword order
Dietrich Kuske, Georg Zetzsche
We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by thresh…
Infinite and Bi-infinite Words with Decidable Monadic Theories
Dietrich Kuske, Jiamou Liu, Anastasia Moskvina
We study word structures of the form where is either or , is the natural linear ordering on and is a predicate on .…
First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed!
Dietrich Kuske, Nicole Schweikardt
We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various…
Multi-Buffer Simulations for Trace Language Inclusion
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske +2
We consider simulation games played between Spoiler and Duplicator on two Büchi automata in which the choices made by Spoiler can be buffered by Duplicator in several buffers befor…