A universal planar automaton is determined by its semigroup of input symbols

摘要

Universal planar automata are universally attracted objects in the category of automata, for which the set of states and the set of output symbols are equipped with structures of planes. We investigate the problem of determinability of these automata by their semigroups of input symbols.