# On the Average Complexity of Strong Star Normal Form

Abstract : For regular expressions in (strong) star normal form a large set of efficient algorithms is known, from conversions into finite automata to characterisations of unambiguity. In this paper we study the average complexity of this class of expressions using analytic combinatorics. As it is not always feasible to obtain explicit expressions for the generating functions involved, here we show how to get the required information for the asymptotic estimates with an indirect use of the existence of Puiseux expansions at singularities. We study, asymptotically and on average, the alphabetic size, the size of the $\varepsilon$-follow automaton and the ratio of these expressions to standard regular expressions.
Document type :
Conference papers
Domain :

https://hal.inria.fr/hal-01657014
Contributor : Hal Ifip <>
Submitted on : Wednesday, December 6, 2017 - 11:44:37 AM
Last modification on : Sunday, November 15, 2020 - 7:30:03 PM

### File

440206_1_En_6_Chapter.pdf
Files produced by the author(s)

### Citation

Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. On the Average Complexity of Strong Star Normal Form. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.77-88, ⟨10.1007/978-3-319-60252-3_6⟩. ⟨hal-01657014⟩

Record views