19 citations · 39 across the 3 of their papers we have counts for
4 papers · 1 filter
Decomposability of Finitely Generated Torsion-free Nilpotent Groups
Gilbert Baumslag, Charles F. Miller, Gretchen Ostheimer
We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.
On groups that have normal forms computable in logspace
Murray Elder, Gillian Elston, Gretchen Ostheimer
We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite…
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…
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…