http://nova.newcastle.edu.au/vital/access/services/Feed ${session.getAttribute("locale")} 5 http://nova.newcastle.edu.au/vital/access/manager/Repository/uon:11038 We consider how the languages of G-automata compare with other formal language classes. We prove that if the word problem of G is accepted by a machine in the class ℳ then the language of any G-automaton is in the class ℳ. It follows that the so called counter languages (languages of ℤⁿ-automata) are context-sensitive, and further that counter languages are indexed if and only if the word problem for ℤⁿ is indexed. 2012-07-03T04:30:00.082Z ]]>