Absorbing patterns in BST-like expression-trees

DOI10.4230/LIPICS.STACS.2021.48MaRDI QIDQ7231572zbMATH OpenFDO

Authors Florent Koechlin, Pablo Rotondo

Publication date 21 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2021.48

zbMATH Keywords

absorbing patternanalytic combinatoricsBST treesreduction

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A note on the height of binary search trees
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• Analytic combinatorics
• And/or trees: A local limit point of view
• Associative and commutative tree representations for Boolean functions
• Asymptotic expansions for ordinary differential equations
• Average analysis of Glushkov automata under a BST-like model
• Differentiably finite power series
• scientific article; zbMATH DE number 1080355 (Why is no real title available?)
• scientific article; zbMATH DE number 2102710 (Why is no real title available?)
• scientific article; zbMATH DE number 3294854 (Why is no real title available?)
• On the Average Size of Glushkov’s Automata
• On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
• The average height of binary trees and other simple trees
• The growing tree distribution on Boolean functions.
• Uniform random expressions lack expressivity

This page was built for publication: Absorbing patterns in BST-like expression-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231572)