A novel approach to finite automata with control application to transport systems

The paper shows 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 similar to some sense to the canonical form of Shegalkin polynomials (1928). However common algebra is used instead of Boolean algebra. As a special class, systems which are linear in the sense of common algebra are considered in some detail. An example of practical importance are transport systems in production lines. Based on classical concepts of eigenvalue assignment, feedback control structures are discussed aiming at cyclic feed of production lines with different raw materials such that the throughput of each type of raw material complies with some specified demand.<
>