DTRNN based on threshold units

The first four papers featured in this chapter (Goudreau et al., 1994; Horne and Hush, 1996; Kremer, 1995; Alon et al., 1991) deal with the implementation of finite-state machines such as deterministic finite-state automata (DFA, section 2.3.3) or Mealy machines (section 2.3.1) in DTRNN made up of threshold linear units. The first such construction was proposed by (Minsky, 1967) (see chapter 2), and used a number of TLU which grew linearly with the number of states $\vert Q\vert$ in the FSMTwo of the papers featured in this section (Horne and Hush, 1996; Alon et al., 1991) explore the possibility of encoding $\vert Q\vert$-state automata in less than $O(\vert Q\vert)$ units.^5.3