12 citations · 64 across the 32 of their papers we have counts for
15 papers · 1 filter
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…
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…
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions
Volker Diekert, Lukas Fleischer
What is the common link, if there is any, between Church-Rosser systems, prefix codes with bounded synchronization delay, and local Rees extensions? The first obvious answer is tha…
Solutions of Word Equations over Partially Commutative Structures
Volker Diekert, Artur Jeż, Manfred Kufleitner +1
Let be a free partially commutative monoid with involution and its quotient group (for example, a right-angled Artin or Coxeter group). We show that for any syste…