Automata system in finitelly generated groups
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914376483602432 |
|---|---|
| author | Gusev, D. Ivanov-Pogodaev, I. A. Kanel-Belov, A. |
| author_facet | Gusev, D. Ivanov-Pogodaev, I. A. Kanel-Belov, A. |
| contents | We prove that any finite system of interacted automata can not leave some finite arear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If group is finitely generated and aperiodic then it can not be explored by any system of finite automata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1812_00716 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Automata system in finitelly generated groups Gusev, D. Ivanov-Pogodaev, I. A. Kanel-Belov, A. Group Theory Logic 20F10 We prove that any finite system of interacted automata can not leave some finite arear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If group is finitely generated and aperiodic then it can not be explored by any system of finite automata. |
| title | Automata system in finitelly generated groups |
| topic | Group Theory Logic 20F10 |
| url | https://arxiv.org/abs/1812.00716 |