Old Web
English
Sign In
Acemap
>
Paper
>
The growth rate over trees of any family of sets defined by a monadic second order formula is semi-computable
The growth rate over trees of any family of sets defined by a monadic second order formula is semi-computable
2021
Matthieu Rosenfeld
Keywords:
Combinatorics
Mathematics
Growth rate
Family of sets
Monad (functional programming)
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
3
Citations
NaN
KQI
[]