Abstract
Universal planar automata are universal 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
