On a single method of symbolic representation of cascade and parallel connections of normal n-wire networks

In this paper we set forth a method of symbolic representation of cascade and parallel connections of normal n-wire networks, i.e. processions of non-interacting two-terminal networks. The complexity of the representation of the cascade and parallel connections of the normal n-wire networks'by means of a procession of n two-terminal networks is proportional to the number n, whereas if matrices are used it is proportional to the square of this number. Therein lies the main advantage of the "procession" method proposed in this article over the usual matrix method of describing such connections of normal n-wire networks.