To cryptanalysis of $2$-cascade finite automata cryptographic generators

An abstract finite automaton cryptographic generator generalizing the register $(\delta,\tau)$-step generator is defined. Some attacks on it with the object to determine initial states or (and) output functions of its automata are presented. The complexity of these attacks are much less than the complexity of the brute-force attack.