The number of similarity relations and the number of minimal deterministic finite cover automata

Finite Deterministic Cover Automata (DFCA) can be obtained from Deterministic Finite Automata (DFA) using the similarity relation. Since the similarity relation is not an equivalence relation, the minimal DFCA for a finite language is usually not unique. We count the number of minimal DFCA that can be obtained from a given minimal DFA with n states by merging the similar states in the given DFA. We compute an upper bound for this number and prove that in the worst case (for a non-unary alphabet) it is ⌈4<i>n</i>-9+√8<i>n</i>+1/8⌉!/(2⌈4<i>n</i>-9+√8<i>n</i>+1/8⌉ - <i>n</i> + 1)! We prove that this upper bound is reached, i.e. for any given positive integer <i>n</i> we find a minimal DFA with <i>n</i> states, which has the number of minimal DFCA obtained by merging similar states equal to this maximum.