A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law

2012
*
Discrete Mathematics and Theoretical Computer Science DMTCS
*
unpublished

Let T be a monadic-second order class of finite trees, and let T(x) be its (ordinary) generating function, with radius of convergence ρ. If ρ ≥ 1 then T has an explicit specification (without using recursion) in terms of the operations of union, sum, stack, and the multiset operators n and (≥ n). Using this, one has an explicit expression for T(x) in terms of the initial functions x and x · 1 − x n −1 , the operations of addition and multiplication, and the Pólya exponentiation operators En, E

fatcat:ydc5fvau25g6dompb5q4yoqs7e