G-automata, counter languages and the Chomsky hierarchy
| dc.creator | Elder, Murray | |
| dc.date | 2005-08-09 | |
| dc.date | 2005-08-09 | |
| dc.date.accessioned | 2026-07-07T06:34:11Z | |
| dc.date.available | 2026-07-07T06:34:11Z | |
| dc.description | 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. | |
| dc.description | 5 pages | |
| dc.identifier | https://arxiv.org/abs/math/0508166 | |
| dc.identifier | http://arxiv.org/abs/math/0508166 | |
| dc.identifier | Proceedings of Groups St Andrews 2005, London Mathematical Society Lecture Note Series (339), eds C. Campbell, M. Quick, E. Robertson, G. Smith | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/99446 | |
| dc.subject | Group Theory | |
| dc.subject | 20F65 | |
| dc.title | G-automata, counter languages and the Chomsky hierarchy | |
| dc.type | text |