Random Regular Expression Over Huge Alphabets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2021

Random Regular Expression Over Huge Alphabets

Résumé

In this article, we study some properties of random regular expressions of size n, when the cardinality of the alphabet also depends on n. For this, we revisit and improve the classical Transfer Theorem from the field of analytic combinatorics. This provides precise estimations for the number of regular expressions, the probability of recognizing the empty word and the expected number of Kleene stars in a random expression. For all these statistics, we show that there is a threshold when the size of the alphabet approaches n^2, at which point the leading term in the asymptotics starts oscillating.
Fichier non déposé

Dates et versions

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

Identifiants

Citer

Cyril Nicaud, Pablo Rotondo. Random Regular Expression Over Huge Alphabets. International Journal of Foundations of Computer Science, 2021, 32 (05), pp.419-438. ⟨10.1142/S012905412141001X⟩. ⟨hal-04484425⟩
28 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More