19 citations · 39 across the 3 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
math.GR2006★ 18 cited
On groups and counter automata
Murray Elder, Mark Kambites, Gretchen Ostheimer
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense…
math.GR2006★ 2 cited
The word problem distinguishes counter languages
Sean Cleary, Murray Elder, Gretchen Ostheimer
Counter automata are more powerful versions of finite-state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We sh…