G-automata, counter languages and the Chomsky hierarchy

Details G-automata, counter languages and the Chomsky hierarchy G-automata, counter languages and the Chomsky hierarchy

2005-08-09

arxiv.org/abs/math/0508166v2

Proceedings of Groups St Andrews 2005, London Mathematical Society Lecture Note Series (339), eds C. Campbell, M. Quick, E. Ro

Mathematics

Group Theory

5 pages

Scientific paper

We consider how the languages of $G$-automata compare with other formal language classes. We prove that if the word problem of a group $G$ is accepted by a machine in the class $\mathcal M$ then the language of any $G$-automaton is in the class $\mathcal M$. It follows that the so called {\emph counter languages} (languages of $\mathbb Z^n$-automata) are context-sensitive, and further that counter languages are indexed if and only if the word problem for $\mathbb Z^n$ is indexed.

Affiliated with

Also associated with

No associations

Rating

G-automata, counter languages and the Chomsky hierarchy 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 G-automata, counter languages and the Chomsky hierarchy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and G-automata, counter languages and the Chomsky hierarchy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-577039