diff	2009-02-26 11:20:52 - revision [ Version = 10 --> (current) ] by bci1

diff	2009-02-26 11:16:24 - revision [ Version = 9 --> Version 10 ] by bci1 A {\em (classical) automaton, s-automaton} $\A$, or sequential machine,

diff	2009-02-26 11:09:31 - revision [ Version = 8 --> Version 9 ] by bci1

diff	2009-02-26 11:05:50 - revision [ Version = 7 --> Version 8 ] by bci1

diff	2009-02-26 02:38:49 - revision [ Version = 6 --> Version 7 ] by bci1

diff	2009-01-27 23:47:00 - revision [ Version = 5 --> Version 6 ] by bci1

diff	2009-01-27 23:43:59 - revision [ Version = 4 --> Version 5 ] by bci1

diff	2009-01-27 23:43:19 - revision [ Version = 3 --> Version 4 ] by bci1

diff	2009-01-27 23:33:18 - revision [ Version = 2 --> Version 3 ] by bci1

diff

2009-01-27 23:32:31 - revision [ Version = 1 --> Version 2 ] by bci1 \begin{definition} A {\em classical automaton} $\A$, or sequential machine, is defined as a quintuple of sets, I,O and S, and set-theoretical mappings, $$(I, O, S, \delta: I \times S \rightarrow S; \lambda: S \times S \rightarrow O),$$ with $\delta$ being called the {\em transition function} and $\lambda$ being called the {\em output function}. \end{definition}