Simplifications of Uniform Expressions Specified by Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2021

Simplifications of Uniform Expressions Specified by Systems

Résumé

In this article, we study the impact of applying simple reduction rules to random syntactic formulas encoded as trees. We assume that there is an operator that has an absorbing pattern and prove that if we use this property to simplify a uniform random expression with [Formula: see text] nodes, then the expected size of the result is bounded by a constant. The same holds for higher moments, establishing the lack of expressivity of uniform random expressions. Our framework is quite general as we consider expressions defined by systems of combinatorial equations. For our proofs, we rely on Drmota’s multidimensional theorem for systems of generating functions.
Fichier non déposé

Dates et versions

hal-04484336 , version 1 (29-02-2024)

Identifiants

Citer

Florent Koechlin, Cyril Nicaud, Pablo Rotondo. Simplifications of Uniform Expressions Specified by Systems. International Journal of Foundations of Computer Science, 2021, 32 (06), pp.733-760. ⟨10.1142/S0129054121420065⟩. ⟨hal-04484336⟩
9 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More