13 citations · 31 across the 11 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.GR2019★ 3 cited
On Orbits and the Finiteness of Bounded Automaton Groups
Ievgen Bondarenko, Jan Philipp Wächter
We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences havin…
cs.FL2019★ 1 cited
An Automaton Group with PSPACE-Complete Word Problem
Jan Philipp Wächter, Armin Weiß
We construct an automaton group with a PSPACE-complete word problem, proving a conjecture due to Steinberg. Additionally, the constructed group has a provably more difficult, namel…