On the Number of Transitions Entering the States of a Finite Automaton

In recent years adaptive threshold ele-ments have been used as the basis for learning machines such as the Perceptron [1] and Adaline [2]. To the author´s knowledge there has been no previously reported work on a systematic study of algorithms, used in learning machines, to modify the weightvalues of threshold elements.