On groups and counter automata

Details On groups and counter automata On groups and counter automata

2006-11-07

arxiv.org/abs/math/0611188v1

Mathematics

Group Theory

18 pages

Scientific paper

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 of Greibach if and only if it is virtually free abelian of rank n; this result, which answers a question of Gilman, is in a very precise sense an abelian analogue of the Muller-Schupp theorem. More generally, if G is a virtually abelian group then every group with word problem recognised by a G-automaton is virtually abelian with growth class bounded above by the growth class of G. We consider also other types of counter automata.

Affiliated with

Also associated with

No associations

Rating

On groups and counter automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On groups and counter automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On groups and counter automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-617872