Semiautomaton
In mathematics and computer science, a semiautomaton or M-act is the multiplicative operation of a monoid on a set. From an algebraic point of view, it is very nearly identical to the concept of an action of a group. From the computer science point of view, it is an automaton having only an input, and no output. From the category theoretic point of view, acts are important as functors on categories.
| ||||||
Search Dictionary:
