Sciweavers

DLT
2008
14 years 1 months ago
The Average State Complexity of the Star of a Finite Set of Words Is Linear
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
Frédérique Bassino, Laura Giambruno,...