Automata and square complexes.

From MaRDI portal




Abstract: 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.




Cited in
(35)






This page was built for publication: Automata and square complexes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487750)