Average Analysis of Glushkov Automata under a BST-Like Model

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.

[1]  Valentin M. Antimirov.  Partial Derivatives of Regular Expressions and Finite Automaton Constructions , 1996, Theor. Comput. Sci..

[2]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[3]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[4]  Conrado Martínez Parra.  Statistics under the BST model , 1992 .

[5]  Cyril Nicaud,et al.  On the Average Size of Glushkov's Automata , 2009, LATA.

[6]  Lucian Ilie,et al.  Follow automata , 2003, Inf. Comput..

[7]  Luc Devroye,et al.  A note on the height of binary search trees , 1986, JACM.

[8]  V. Glushkov.  THE ABSTRACT THEORY OF AUTOMATA , 1961 .

[9]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[10]  Michael Drmota.  An analytic approach to the height of binary search trees II , 2003, JACM.

[11]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[12]  Djelloul Ziadi,et al.  Canonical derivatives, partial derivatives and finite automaton constructions , 2002, Theor. Comput. Sci..

[13]  Conrado Martínez,et al.  Statistics under the BST model , 1992 .

[14]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[15]  John Michael Robson,et al.  The Height of Binary Search Trees , 1979, Aust. Comput. J..

[16]  Gérard Berry,et al.  From Regular Expressions to Deterministic Automata , 1986, Theor. Comput. Sci..

[17]  Fausto Giunchiglia,et al.  Improved Automata Generation for Linear Temporal Logic , 1999, CAV.

[18]  Michael Drmota.  An analytic approach to the height of binary search trees , 2007, Algorithmica.

[19]  Keijo Heljanko,et al.  Testing SPIN's LTL Formula Conversion into Büchi Automata with Randomly Generated Input , 2000, SPIN.

[20]  Philippe Flajolet,et al.  The Average Height of Binary Trees and Other Simple Trees , 1982, J. Comput. Syst. Sci..