[1]
C. A. Rich and G. Slutzki, “The complexity of a counting finite state automaton”, Acta Cybern, vol. 9, no. 4, pp. 403-417, Jan. 1990.