New Algorithms for Combinations of Objectives using Separating Automata. - Ashwani Anand; Nathanaël Fijalkow; Aliénor Goubault-Larrecq; Jérôme Leroux; Pierre Ohlmann (GandALF, 2021)

Rice-like complexity lower bounds for Boolean and uniform automata networks. - Aliénor Goubault-Larrecq; Kévin Perrot (CoRR, 2024)

Circuit Metaconstruction in Logspace for Rice-Like Complexity Lower Bounds in ANs and SGRs. - Aliénor Goubault-Larrecq; Kévin Perrot (CiE, 2025)