Decidability in Group Shifts and Group Cellular Automata. - Pierre Béaur; Jarkko Kari (MFCS, 2020)

Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton. - Pierre Béaur; Benjamin Hellouin de Menibus (WORDS, 2023)

Sturmian and infinitely desubstitutable words accepted by an ω-automaton. - Pierre Béaur; Benjamin Hellouin de Menibus (CoRR, 2023)

String attractors and bi-infinite words. - Pierre Béaur; France Gheeraert; Benjamin Hellouin de Menibus (CoRR, 2024)

Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata. - Pierre Béaur; Jarkko Kari (Int. J. Found. Comput. Sci., 2024)

Algorithmique et combinatoire des mots par les représentations S-adiques. (Algorithms and combinatorics on words using S-adic representations). - Pierre Béaur (2024)