On a problem for networks of linear automata without loss of information

We consider the minimization of the time of reconstructing the inputs of a network of linear automata without loss of information through its observed outputs and known initial state. This problem is shown to be reducible to the classical problem of the minimal-cost flow in the so-called generated network constructed from the original network of automata.