Abstract
Abstract The paper is concerned with discrete-event dynamical systems encountered in many problems of modern production control and transportation processes. An adequate way to model dynamical systems of this type is provided by the theory of finite automata, since the input; the state and the output of such systems are binary variables. This paper will show that finite automata are much closer related to discrete time systems than assumed in the past. To this end a novel representation of Boolean functions is introduced which allows imbedding finite state machines into the class of discrete time systems. The main body of the paper is devoted to algebraically linear automata. As an example of practical importance the paper discusses transportation processes of discrete parts as they occur in complex production lines.
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.
