Abstract
Abstract We study the graphs of transitions between states of nonautonomous automata that provide, with independent equiprobable input signs, an equiprobable distribution on the set of all states in the minimum possible number of cycles, as is the case of the de Bruijn graphs corresponding to shift registers. It is proved that in the case of a binary input alphabet, there are at least 12r−33 pairwise nonisomorphic directed graphs with 2 r vertices that have this property. All graphs of this type with 8 and 9 vertices are found.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.