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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
