The Growth Rate over Trees of any Family of Sets Defined by a Monadic Second Order Formula is Semi-Computable

von Rosenfeld, Matthieu
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 2 of 4 (2021)

Avoidability of Additive Cubes over Alphabets of Four Numbers

von Lietard, Florian
Veröffentlicht in DLT (24. : 2020 : Tampa, Fla.) Developments in language theory (2020)