论文信息 - Implementing Computations in Automaton (Semi)groups

Implementing Computations in Automaton (Semi)groups

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order of finite automaton (semi)groups.

Ines Klimann | Matthieu Picantin | Jean Mairesse

[1] Laurent Bartholdi,et al. The smallest Mealy automaton of intermediate growth , 2006 .

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] Pedro V. Silva,et al. On a Class of Automata Groups Generalizing Lamplighter Groups , 2005, Int. J. Algebra Comput..

[4] Volodymyr Nekrashevych,et al. Self-Similar Groups , 2005, 2304.11232.

[5] Ines Klimann,et al. On the Finiteness Problem for Automaton (Semi)Groups , 2011, Int. J. Algebra Comput..

[6] Dmytro Savchuk,et al. Automata generating free products of groups of order 2 , 2008, 0806.4801.

[7] I. Bondarenko,et al. On the conjugacy problem for finite-state automorphisms of regular rooted trees , 2010, 1011.2227.

[8] Zoran Sunic,et al. The conjugacy problem is not solvable in automaton groups , 2010 .

[9] Said Sidki,et al. Automorphisms of one-rooted trees: Growth, circuit structure, and acyclicity , 2000 .

[10] R. Grigorchuk,et al. Bernside's problem on periodic groups , 1980 .

[11] Alan J. Cain. Automaton semigroups , 2009, Theor. Comput. Sci..