caa a22 4500 445344725 CHVBK 20180317142825.0 cr unu---uuuuu 170323e20110201xx s 000 0 eng 10.1007/s00233-010-9256-8 doi (NATIONALLICENCE)springer-10.1007/s00233-010-9256-8 Molchanov Vladimir Dept. of Computer Science and Information Technologies, Saratov State Socio-Economic University, 89, Radischeva str., 410003, Saratov, Russia aut A universal planar automaton is determined byitssemigroup of input symbols [Elektronische Daten] [Vladimir Molchanov] 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. Springer Science+Business Media, LLC, 2010 Semigroup nationallicence Automaton nationallicence Affine and projective planes nationallicence Semigroup Forum Springer-Verlag 82/1(2011-02-01), 1-9 0037-1912 82:1<1 2011 82 233 https://doi.org/10.1007/s00233-010-9256-8 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00233-010-9256-8 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Molchanov Vladimir Dept. of Computer Science and Information Technologies, Saratov State Socio-Economic University, 89, Radischeva str., 410003, Saratov, Russia aut NATIONALLICENCE 773 0- Semigroup Forum Springer-Verlag 82/1(2011-02-01), 1-9 0037-1912 82:1<1 2011 82 233 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer