The Average State Complexity of Rational Operations on Finite Languages

Frédérique Bassino (1) , Laura Giambruno (2) , Cyril Nicaud (3)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 Dipartimento di Matematica e Applicazioni [Palermo]
3 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Domaines: Mathématique discrète [cs.DM]

Frédérique Bassino, Laura Giambruno, Cyril Nicaud. The Average State Complexity of Rational Operations on Finite Languages. International Journal of Foundations of Computer Science, 2010, 21 (4), pp.495-515. ⟨hal-00452751v2⟩