Automata and Square Complexes
| dc.creator | Glasner, Yair | |
| dc.creator | Mozes, Shahar | |
| dc.date | 2003-06-17 | |
| dc.date.accessioned | 2026-07-07T04:59:01Z | |
| dc.date.available | 2026-07-07T04:59:01Z | |
| dc.description | We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method we give examples of free groups and of Kazhdan groups which are generated by the different states of one finite (bi-reversible) automaton. We also reproduce the theorem of Macedonska, Nekrashevych, Sushchansky, on the connection between bi-reversible automata and the commensurator of a regular tree. | |
| dc.description | 21 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/math/0306259 | |
| dc.identifier | http://arxiv.org/abs/math/0306259 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67813 | |
| dc.subject | Group Theory | |
| dc.subject | 20M35 (Primary) 20F05,37B15,20E08 (Secondary) | |
| dc.title | Automata and Square Complexes | |
| dc.type | text |