Skip to main content
Log in

Representation of Automata by Groups. II

  • Published:
Ukrainian Mathematical Journal Aims and scope

    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.

Abstract

We obtain necessary and sufficient conditions under which the representation of abstract automata in terms of finite groups is consistent with the transition function of an automaton. We obtain sufficient conditions under which the mapping of a free semigroup of an automaton into a group realized by a component of the representation is a homomorphism.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. V. G. Skobelev, “Representation of automata by groups,” Ukr. Mat. Zh., 44, No.10, 1412–1416 (1992).

    Google Scholar 

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

    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) [in Russian], Nauka, Moscow (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skobelev, V.G. Representation of Automata by Groups. II. Ukrainian Mathematical Journal 52, 1597–1605 (2000). https://doi.org/10.1023/A:1010405201956

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010405201956

Keywords

Navigation