Web page of Dmytro Savchuk |

3-state Automata acting on 2-letter alphabet

This is a scipt accompanying the paper:

- "Classification of groups generated by 3-state automata over a 2-letter alphabet" (with I. Bondarenko, R. Grigorchuk, R. Kravchenko, Y. Muntyan, V. Nekrashevych and Z. Sunic), Algebra and Discrete Mathematics (2008) 1, 1-163 (arXiv | journal)

For a given 3-state 2-letter automaton it allows to compute the numbers of representatives of symmetry, minimal symmetry, and isomorphism classes. Also it returns some available information about each group. It can also be used in the converse direction: given a number of automaton it will construct the automaton itself. Additional information about each group can be obtained from the paper, and using the AutomGrp package for GAPsystem.

The set of states is {**1**,**2**,**3**}. Permutation σ permutes letters
of the alphabet.