Affiliation:
1. CMUP & DM-DCC, Faculdade de Ciencias da Universidade do Porto, Rua do Campo Alegre, Porto, Portugal
Abstract
Average-case complexity results provide important information about computational models and methods, as worst-case scenarios usually occur for a negligible amount of cases. The framework of analytic combinatorics provides an elegant tool for that analysis, completely avoiding the use of statistical methods, by relating combinatorial objects to algebraic properties of complex analytic generating functions. We have previously used this framework to study the average size of di erent nondeterministic nite automata simulations of regular expressions. In some cases it was not feasible to obtain explicit expressions for the generating functions involved, and we had to resort to Puiseux expansions. This is particularly important when dealing with families of generating functions indexed by a parameter, e.g. the size of underlying alphabets, and when the corresponding generating functions are obtained by algebraic curves of degree higher than two. In this paper we expound our approach in a tutorial pace, providing sufficient details to make it available to the reader.
Publisher
Association for Computing Machinery (ACM)
Reference41 articles.
1. [ABR] J. Abbott A. M. Bigatti and L. Robbiano. CoCoA: a system for doing Computations in Commutative Algebra. Available at http://cocoa.dima.unige.it. [ABR] J. Abbott A. M. Bigatti and L. Robbiano. CoCoA: a system for doing Computations in Commutative Algebra. Available at http://cocoa.dima.unige.it.
2. Enumeration and generation with a string automata representation
3. EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
4. Partial derivatives of regular expressions and finite automaton constructions
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献