"Any device that has a specific number – i.e. a finite number – of possible conditions" (M. CAUDILL, 1992, p.46).
M. CAUDILL writes: "The best everyday example of a finite state machine is a traffic light. A simple traffic light can be in anyone of four possible states. There are no other possible states for that traffic light… It never, for example, has all three lights on… Each of the three lights is either on or off, and each of the states is well defined and predictable. Furthermore well defined transitions exist between the states" (p. 46).
In this precise case, it should be added that the different meanings attached to the different states results of a significant semantic code that must be learned independently.
- 1) General information
- 2) Methodology or model
- 3) Epistemology, ontology and semantics
- 4) Human sciences
- 5) Discipline oriented
To cite this page, please use the following information:
Bertalanffy Center for the Study of Systems Science (2020). Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]
We thank the following partners for making the open access of this volume possible: