Abstract
Abstract This paper describes sufficient completeness conditions for the class of Moore automata, compositions with feedback on this class and the behavior realization. It is shown how to realize a delay by automata from the set satisfying sufficient conditions for completeness. The ideas of these constructions demonstrate how from a set of automata with long cycles of transients can be realized a delay with short cycle of transient. It is shown that there are large finite complete sets of automata, for which any proper subsets are not complete.
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.
