On groups generated by bi-reversible automata: the two-state case over a changing alphabet

Adam Woryna

The notion of an automaton over a changing alphabet $X=(X_i{)}_{i\ge 1}$ is used to define and study automorphism groups of the tree $X^{\ast }$ of finite words over $X$. The concept of b…