Abstract
A supervisor realized by a finite automaton is called a finite state supervisor. First, the paper shows the equivalence of deterministic and nondeterministic finite state supervisors. Next, it proves a necessary and sufficient condition for the existence of a finite state supervisor. Finally, it shows an example of a supervisor for a nonregular control specification. >
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.
