I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
2013, VOLUME 18, NUMBER 3, PAGES 139-148
V. A. Molchanov
View as HTML View as gif image
Universal planar automata are universally attracted objects in the category of automata, for which the sets of states and output symbols are endowed with structures of planes. It was proved that these automata are determined up to isomorphism by their semigroups of input symbols. We investigate the problem of concrete characterization of these automata.
|Main page||Contents of the journal||News||Search|
Last modified: March 4, 2014