Pages that link to "Item:Q4345363"
From MaRDI portal
The following pages link to Coloring rules for finite trees, and probabilities of monadic second order sentences (Q4345363):
Displaying 17 items.
- Non-redundant random generation algorithms for weighted context-free grammars (Q391421) (← links)
- Enumeration of viral capsid assembly pathways: tree orbits under permutation group action (Q542011) (← links)
- Generalised and quotient models for random and/or~trees and application to satisfiability (Q727977) (← links)
- On the number of matchings of a tree (Q875067) (← links)
- Collapsing words, permutation conditions and coherent colorings of trees (Q1019195) (← links)
- On the structure of random unlabelled acyclic graphs. (Q1426116) (← links)
- Enumerating lambda terms by weighted length of their de Bruijn representation (Q1706116) (← links)
- Logical limit laws for minor-closed classes of graphs (Q1745738) (← links)
- MSO 0-1 law for recursive random trees (Q2244503) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
- Recursion and growth estimates in renormalizable quantum field theory (Q2517916) (← links)
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results (Q2566073) (← links)
- The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)
- A sprouting tree model for random boolean functions (Q3460511) (← links)
- Complexity and Limiting Ratio of Boolean Functions over Implication (Q3599140) (← links)
- Formulae and Asymptotics for Coefficients of Algebraic Functions (Q5364226) (← links)
- A logical limit law for \(231\)-avoiding permutations (Q6606908) (← links)
