Canonical Representation of Input Processes in the Dynamics of Automata

We consider a continuous-time inertialess $(n,1)$-pole which realizes an arbitrary Boolean function $y=f(x_1,\dots,x_n)$ in response to arbitrary switching processes $x_1(t),\dots,x_n(t)$ on its inputs. It is shown that these processes always can be replaced with an equivalent combination of pulses which are linearly ordered in time and free (i.e., not assigned to particular input terminals). This essentially simplifies the identification of the response of the $(n,1)$-pole to complex input processes.