On Average Behaviour of Regular Expressions in Strong Star Normal Form

• Tipo: Artigo em Revista Científica Internacional
• Data: 2019

Autores

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

Revista

Título: International Journal of Foundations of Computer Science

Vol. 30

Páginas: 899-920

ISSN: 0129-0541

Editora: World Scientific

Indexação

ISI Web of Knowledge - 7 Citações

Scopus - 8 Citações

Outras Informações

ID Authenticus: 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 22