Some criteria for determining recognizability of a set

Let an be the number of strings of length n in a set A ⊆ ∑*, where ∑ is a finite alphabet. Several criteria for determining that a set is not recognizable by a finite automaton are given, based solely on the sequence {an}. The sequence {an} is also used to define a finitely addititive probability measure on all recognizable sets