THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES-Reference-Cited by-同舟云学术

THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES

Published:2010-08 Issue:04 Volume:21 Page:495-516
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

BASSINO FRÉDÉRIQUE¹,GIAMBRUNO LAURA²,NICAUD CYRIL³

Affiliation:

1. LIPN UMR CNRS 7030, Université Paris 13, 93430 Villetaneuse, France

2. Dipartimento di Matematica e Applicazioni, Universitàdi Palermo, Italy

3. LIGM UMR CNRS 8049, Université Paris-Est, 77454 Marne-la-Vallée, France

Abstract

Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we establish that the average state complexities of the rational operations are asymptotically linear.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054110007398

Reference13 articles.

1. State Complexity of Regular Languages: Finite versus Infinite

2. Parsing with a finite dictionary

3. Analytic Combinatorics

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. More on deterministic and nondeterministic finite cover automata;Theoretical Computer Science;2017-05

2. More on Deterministic and Nondeterministic Finite Cover Automata;Implementation and Application of Automata;2015

3. A Hitchhiker's Guide to descriptional complexity through analytic combinatorics;Theoretical Computer Science;2014-04

4. Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata;Developments in Language Theory;2013

5. An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata;Combinatorial Pattern Matching;2012