High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! In theoretical computer science, a semiautomaton is an automaton having only an input, and no output. It consists of a set Q of states, a set ? called the input alphabet, and a function T: Q x ? ? Q called the transition function. Associated to any semiautomaton is a monoid called the characteristic monoid, input monoid, transition monoid or transition system of the semiautomaton, which acts on the set of states Q. This may be viewed either as an action of the free monoid of strings in the input alphabet ?, or as the induced transformation semigroup of Q. In older books like Clifford and Preston (1967) S-acts are called "operands".

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.