Symbolic analysis of a decomposition of information processing machines

In this paper we study the problem of replacing (decomposing) a complex finite state sequential machine by several simpler ones which operate in parallel and yield the same result. In the first part, we give the necessary mathematical background and results. In the second part, we apply these results and derive the necessary and sufficient conditions for the existence of a decomposition for a given machine. If a decomposition exists then the required simpler machines which have to be connected in parallel are given