Abstract
A certain class of composite binary automata with strongly connected component automata is studied. Features as equivalence, reduction, and minimality of automata are considered. All quantities are expressed by simple properties of the component automata and the connecting network. This gives a powerful method to construct automata or generate binary sequences with certain prescribed properties.
Sign-in/Register to access full text options 
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.
