12 citations · 64 across the 32 of their papers we have counts for
Showing 2012 · math.GRShow all
3 papers · 2 filters
math.GR2012★ 5 cited
Cyclic rewriting and conjugacy problems
Volker Diekert, Andrew Duncan, Alexei Myasnikov
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which i…
math.GR2012★ 10 cited
Context-Free Groups and Their Structure Trees
Volker Diekert, Armin Weiß
Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary an…
math.GR2012
Logspace Computations in Coxeter Groups and Graph Groups
Volker Diekert, Jonathan Kausch, Markus Lohrey
Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of appl…