Average Analysis of Glushkov Automata under a BST-Like Model - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Average Analysis of Glushkov Automata under a BST-Like Model

Cyril Nicaud
Carine Pivoteau
Benoît Razet
  • Function : Author

Abstract

We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the expressions. A recent work shows that, under the uniform distribution, regular expressions lead to automata with a linear number of transitions. However, uniform regular expressions are not necessarily a satisfying model. Therefore, we rather focus on an other model, inspired from random binary search trees (BST), which is widely used, in particular for testing. We establish that, in this case, the average number of transitions becomes quadratic according to the size of the regular expression.
Fichier principal
Vignette du fichier
nipira10.pdf (294.08 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

hal-00620382 , version 1 (30-01-2013)

Identifiers

  • HAL Id : hal-00620382 , version 1

Cite

Cyril Nicaud, Carine Pivoteau, Benoît Razet. Average Analysis of Glushkov Automata under a BST-Like Model. 30th Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), 2010, India. pp.388-399. ⟨hal-00620382⟩
91 View
173 Download

Share

Gmail Facebook X LinkedIn More