12 citations · 64 across the 32 of their papers we have counts for
38 papers
Quadratic Equations in Graph Products of Groups and the Exponent of Periodicity
Volker Diekert, Silas Natterer, Alexander Thumm
In 1977, Makanin established the decidability of equations in free monoids. A key ingredient in his proof is the exponent of periodicity: for a word , it is the largest exponent…
Quadratic word equations with regular constraints and the exponent of periodicity
Volker Diekert, Silas Natterer, Alexander Thumm
In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily l…
Reachability Games and Parity Games
Volker Diekert, Manfred Kufleitner
Parity games are positionally determined. This is a fundamental and classical result. In 2010, Calude et al. showed a breakthrough result for finite parity games: the winning regio…
Properties of Graphs Specified by a Regular Language
Volker Diekert, Henning Fernau, Petra Wolf
Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property . What happens if this question is modified i…
Regular matching problems for infinite trees
Carlos Camino, Volker Diekert, Besik Dundua +2
We study the matching problem of regular tree languages, that is, "?" where are regular tree languages over the union of finite ranked alphabets $Σ…
Decidability of membership problems for flat rational subsets of and singular matrices
Volker Diekert, Igor Potapov, Pavel Semukhin
We consider membership problems for rational subsets of the semigroup of matrices over . For a semigroup , the rational subsets are def…