Skip to main content
SpringerLink
Log in

Representation of automata by groups

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We consider the problem of representing abstract automata by finite groups. We prove the universality of the proposed representation and study its properties.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. A. Gill, Linear Sequential Circuits. Analysis, Synthesis and Applications, McGraw Hill, New York (1966).

    Google Scholar 

  2. M. I. Kargapolov and Yu. I. Merzlyakov, Fundamentals of Group Theory [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  3. A. I. Mal'tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  4. B. A. Trakhtenbrot and Ya. M. Barzdin', Finite Automata (Behavior and Synthesis), North-Holland, Amsterdam (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Mechanics, Academy of Sciences of the Ukraine, Donetsk

    V. G. Skobelev

Authors
  1. V. G. Skobelev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 10, pp. 1412–1416, October, 1992.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skobelev, V.G. Representation of automata by groups. Ukr Math J 44, 1298–1302 (1992). https://doi.org/10.1007/BF01057689

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01057689

Keywords

Search

Navigation