Matthieu Rosenfeld. The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 776-795, SIAM, 2021. [doi]
@inproceedings{Rosenfeld21, title = {The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable}, author = {Matthieu Rosenfeld}, year = {2021}, doi = {10.1137/1.9781611976465.49}, url = {https://doi.org/10.1137/1.9781611976465.49}, researchr = {https://researchr.org/publication/Rosenfeld21}, cites = {0}, citedby = {0}, pages = {776-795}, booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021}, editor = {Dániel Marx}, publisher = {SIAM}, isbn = {978-1-61197-646-5}, }