Abstract
A simple method is derived for obtaining all homomorphic images of a transition graph, i.e., a finite, directed graph with at most one edge issuing from each vertex. The method consists of the successive application of elementary steps, corresponding to four types of "elementary" congruences. It is also shown that the number of elementary steps required to derive a given homomorphic image is constant, if the original transition graph is complete and connected. The applicability of this study to sequential machine decompositions is outlined.
| Original language | English |
|---|---|
| Pages (from-to) | 291-296 |
| Number of pages | 6 |
| Journal | Journal of the Franklin Institute |
| Volume | 278 |
| Issue number | 5 |
| DOIs | |
| State | Published - Nov 1964 |
| Externally published | Yes |
Bibliographical note
Funding Information:The research of the first named author was supported by the U. S. search, Information Systems Branch, under Contract No. N62558-3510.