7 citations to 10.1007/s10958-008-9262-5 (Crossref Cited-By Service)

1. Adam Woryna, “The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata”, Theoretical Computer Science, 482, 2013, 96  
2. Thibault Godin, Ines Klimann, Matthieu Picantin, 8977, Language and Automata Theory and Applications, 2015, 328  
3. Tim Becker, Klaus Sutner, 11417, Language and Automata Theory and Applications, 2019, 70  
4. Sébastien Godillon, “Introduction to Iterated Monodromy Groups”, Annales de la Faculté des sciences de Toulouse : Mathématiques, 21, no. S5, 2013, 1069  
5. Adam Woryna, “The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet”, Information and Computation, 249, 2016, 18  
6. Adam Woryna, “The smallest Mealy automaton generating an indicable regular branch group”, Forum Mathematicum, 36, no. 2, 2024, 495  
7. Tullio Ceccherini-Silberstein, Michel Coornaert, Exercises in Cellular Automata and Groups, 2023, 295