Now that you understand Finite State Machines, you can get really clean clothes. Washing Machine A basic washing machine is easily modeled as a finite automaton. One of this friends, an MIT graduate, claimed to be able to model a ba as a finite state machine, but this is probably excessive zeal (or silliness) on his part. We begin this chapter of illustrations with the remark that finite automata can be found everywhere: traffic lights, vending machines, and washing machines (both dish washers and clothes washers). The idea behind this presentation was look at the pictures and note how many uses they This approach was thought not to be sufficient, so the revised chapter adds some explanation when thought useful.
The original draft of this chapter comprised only finite automata, labels of each state and transition, and very few comments. The author of these notes now faces a problem: how much to say about each application being discussed. The purpose of this chapter is not to teach these topics, but to show the utility of finite automata in many areas of study. Each of these topics might easily cover a few weeks in a separate some such as management of TCP, would readily justify an entire course. A casual inspection will reveal that it covers a number of topics, including 1) Stages in a process, 2) Creation and persistence (saving to a file) of objects in a graphical system, 3) Process management in a operating system, 4) Parity checking on a communications line, and 5) Connection management for the Transmission Control Protocol. Goals for This Chapter At first glance this chapter might seem a bit much for the student. Examples will be taken from the theory of operating systems, data communications, and network protocol analysis. This chapter will focus on applications of finite automata, and will include both simple and fairly advanced usages. Preview text Applications of Finite Automata We have now devoted two chapters to the study of finite automata.
0 kommentar(er)
