12 citations · 64 across the 32 of their papers we have counts for
14 papers · 1 filter
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…
Solutions to twisted word equations and equations in virtually free groups
Volker Diekert, Murray Elder
It is well known that the problem solving equations in virtually free groups can be reduced to the problem of solving twisted word equations with regular constraints over free mono…
Solution sets for equations over free groups are EDT0L languages
Laura Ciobanu, Volker Diekert, Murray Elder
We show that, given an equation over a finitely generated free group, the set of all solutions in reduced words forms an effectively constructible EDT0L language. In particular, th…
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the…
SLP compression for solutions of equations with constraints in free and hyperbolic groups
Volker Diekert, Olga Kharlampovich, Atefeh Mohajeri Moghaddam
The paper is a part of an ongoing program which aims to show that the existential theory in free groups (hyperbolic groups or even toral relatively hyperbolic) is NP-complete. For…
Context-Free Groups and Bass-Serre Theory
Volker Diekert, Armin Weiß
The word problem of a finitely generated group is the formal language of words over the generators which are equal to the identity in the group. If this language happens to be cont…