A Hitchhiker's Guide to descriptional complexity through analytic combinatorics

• Published in: Theoretical computer science Vol. 528; pp. 85 - 100
• Main Authors: Broda, Sabine, Machiavelo, António, Moreira, Nelma, Reis, Rogério
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 03.04.2014
• Subjects: Analytic combinatorics; Average-case complexity; Descriptional complexity; Finite automata; Regular expressions; Descriptional complexity; Finite automata; Average-case complexity; Regular expressions; Analytic combinatorics
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2014.02.013

Nowadays, increasing attention is being given to the study of the descriptional complexity in the average case. Although the underlying theory for such a study seems intimidating, one can obtain interesting results in this area without too much effort. In this gentle introduction we take the reader on a journey through the basic analytical tools of that theory, giving some illustrative examples using regular expressions. Additionally, new asymptotic average-case results for several ε-NFA constructions are presented, in a unified framework. It turns out that, asymptotically, and in the average case, the complexity gap between the several constructions is significantly larger than in the worst case. Furthermore, one of the ε-NFA constructions approaches the corresponding ε-free NFA construction, asymptotically and on average. •A step-by-step introduction to methods of analytic combinatorics.•Analysis of three constructions from regular expressions to equivalent ε-NFAs.•A unified framework to evaluate the descriptional complexity of ε-NFA constructions.•New asymptotic average-case complexity results for ε-NFA constructions.