  We give an exact enumerative formula for the minimal acyclic deterministic
finite automata. This formula is obtained from a bijection between a family of
generalized parking functions and the transitions functions of acyclic
automata.
