On Average Behaviour of Regular Expressions in Strong Star Normal Form

• Type: Article in International Scientific Journal
• Date: 2019

Authors

Broda, S (Author) FCUP; António Machiavelo (Author) FCUP; Nelma Moreira (Author) FCUP; Rogério Reis (Author) FCUP

Journal

Title: International Journal of Foundations of Computer Science

Vol. 30

Pages: 899-920

ISSN: 0129-0541

Publisher: World Scientific

Indexing

ISI Web of Knowledge - 7 Citations

Scopus - 8 Citations

Other information

Authenticus ID: P-00R-3HW

DOI: 10.1142/s0129054119400227

Abstract (EN): 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 epsilon-follow automaton and of the position automaton, as well as the ratio and the size of these expressions to standard regular expressions.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 22