Skip to main content
Log in

Algebraic characterization of permutation automata decomposable into a cascade connection of smaller components

  • Published:
Cybernetics Aims and scope

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.

Literature Cited

  1. P. Dömösi, “On superposition of automata,” Acta Cybernetica, Szeged,2, Fasc. 4, 335–343 (1975).

    Google Scholar 

  2. I. Hartmanis and R. E. Stearns, Algebraic Structure Theory of Sequential Machines, Prentice Hall Inc., Englewood Cliffs (1976).

    Google Scholar 

  3. P. Kalman, P. Falb, and M. Arbib, Topics in Methematical System Theory, McGraw-Hill, New York (1969).

    Google Scholar 

  4. M. Arbib (ed.), Algebraic Theory of Machines, Languages, and Semigroups, Academic Press (1968).

  5. M. Hall, Theory of Groups, MacMillan, New York (1959).

    Google Scholar 

  6. A. G. Kurosh, Theory of Groups [in Russian], Nauka, Moscow (1967).

    Google Scholar 

  7. G. P. Agibalov and N. V. Evtushenko, “Characterization, conditions of existence, and other problems of cascade decomposition of finite automata,” in: Materials Symposium on the Theme 1–15. First NKS SEV (Bulgaria, 1978), Budapest (1979).

  8. A. Nozaki, “Practical decomposition,” Inf. Control, No. 8, 275–291 (1978).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 1, pp. 9–15, January–February, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agibalov, G.P., Evtushenko, N.V. Algebraic characterization of permutation automata decomposable into a cascade connection of smaller components. Cybern Syst Anal 20, 12–22 (1984). https://doi.org/10.1007/BF01068863

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation