Skip to main content

Concrete Characterization of Universal Planar Automata

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.


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.

This is a preview of subscription content, access via your institution.


  1. 1.

    A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, Vol. I, Amer. Math. Soc., Providence, Rhode Island (1964).

    Google Scholar 

  2. 2.

    Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  3. 3.

    R. Hartshorne, Foundations of Projective Geometry, Lect. Notes Harvard Univ., W. A. Benjamin, New York (1967).

    MATH  Google Scholar 

  4. 4.

    B. Jónsson, Topics in Universal Algebra, Lect. Notes, Vanderbilt Univ. (1969–1970).

  5. 5.

    V. B. Lender, “On endomorphisms of projective geometries,” in: Investigations of Algebraic Systems (Mat. Zapiski Ural. Gos. Univ.) [in Russian], Sverdlovsk (1984), pp. 48–50.

  6. 6.

    V. A. Molchanov, “Semigroups of mappings on graphs,” Semigroup Forum, 27, 155–199 (1983).

    Article  MATH  MathSciNet  Google Scholar 

  7. 7.

    V. A. Molchanov, “How projective planes are determined by their semigroups,” in: Theory of Semigroups and Its Applications. Semigroups and Related Algebraic Systems [in Russian], Saratov Gos. Univ., Saratov (1984), pp. 42–50.

  8. 8.

    V. A. Molchanov, “A universal planar automaton is determined by its semigroup of input symbols,” Semigroup Forum, 82, 1–9 (2011).

    Article  MATH  MathSciNet  Google Scholar 

  9. 9.

    B. I. Plotkin, L. Ja. Greenglaz, and A. A. Gvaramija, Algebraic Structures in Automata and Databases Theory, World Scientific, Singapore (1992).

  10. 10.

    Sverdlovsk Notebook: Collection of Unsolved Problems in the Semigroup Theory [in Russian], Ural. Gos. Univ., Sverdlovsk (1979).

    Google Scholar 

  11. 11.

    S. M. Ulam, A Collection of Mathematical Problems, Los Alamos Sci. Lab., New Mexico (1960).

    MATH  Google Scholar 

Download references

Author information



Corresponding author

Correspondence to V. A. Molchanov.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 18, No. 3, pp. 139–148, 2013.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Molchanov, V.A. Concrete Characterization of Universal Planar Automata. J Math Sci 206, 554–560 (2015).

Download citation


  • Algebraic System
  • Semigroup Forum
  • Projective Geometry
  • Semigroup Theory
  • Unique Line