arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv math/0306259math.GR
收藏

Automata and Square Complexes

Yair Glasner, Shahar Mozes

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑