Oliinyk A. S.
Ukr. Mat. Zh. - 2010. - 62, № 11. - pp. 1500–1510
We characterize natural categories in which morphisms are defined by partial automata of the following three types: asynchronous automata, window automata, and automata synchronous over finite alphabets. We distinguish subcategories whose morphisms are defined by finite automata.