According to S. LIPSCHUTZ, a complete sequential (or finite state) machine "… consists of five things:
- A finite set A of input symbols
- A finite set S of internal states
- A finite set Z of output symbols
- A next-state function f from S x A into S
- An output function g from S x A into Z" (1976, p. 124).
Compare with the finite automaton, which modifies its internal states, but produces no outputs.
- 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: