Skip to main content
SpringerLink
Log in

Algebraic Interpretation of a Microprogram Finite-State Machine with Datapath of Transitions

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A new principle is proposed for the representation of functions of a microprogram finite state machine with datapath of transitions in the form of a set of some algebras. The principle consists of partitioning the set of tuples forming transition and output functions into subsets each of which is interpreted as a partial function from the signature of the corresponding algebra.

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

References

  1. V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  2. S. I. Baranov, Synthesis of Microprogrammed Automata [in Russian], Energiya, Leningrad (1979).

    Google Scholar 

  3. A. A. Barkalov and R. M. Babakov, “Organization of control units with operational addressing,” USiM, No. 6, 34–39 (2008).

  4. A. A. Barkalov and R. M. Babakov, “Operational formation of state codes in microprogram automata,” Cybernetics and Systems Analysis, 47, No. 2, 193–197 (2011).

    Article  MathSciNet  Google Scholar 

  5. A. A. Barkalov and R. M. Babakov, “Structural representation of the process of synthesis of control automata with datapaths of transitions,” USiM, No. 3, 47–53 (2011).

  6. M. Arbib (ed.), Algebraic Theory of Machines, Languages, and Semigroups [Russian translation], Statistika, Moscow (1975).

    Google Scholar 

  7. B. I. Plotkin, L. Ya. Gringlaz, and A. A. Gvaramiya, Elements of Algebraic Automata Theory: A Textbook for Higher Schools [in Russian], Vyssh. Shkola, Moscow (1994).

    Google Scholar 

  8. J. Cook and G. Beyz, Computer Mathematics [Russian translation], Nauka, Moscow (1990).

    Google Scholar 

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

    MATH  Google Scholar 

  10. B. I. Plotkin, Universal Algebra, Algebraic Logic, and Databases [in Russian], Nauka, Moscow (1991).

    MATH  Google Scholar 

  11. V. M. Glushkov, G. E. Tseytlin, and E. L. Yushchenko, Algebra, Languages, and Programming [in Russian], 3rd Edition, Naukova Dumka, Kyiv (1989).

    Google Scholar 

  12. S. V. Sudoplatov and E. V. Ovchinnikova, Elements of Discrete Mathematics [in Russian], INFRA-M, Moscow and Izd. NGTU, Novosibirsk (2002).

    MATH  Google Scholar 

  13. A. M. Bogomolov and V. N. Salii, Algebraic Foundations of the Theory of Discrete Systems [in Russian], Nauka, Moscow (1997).

    Google Scholar 

  14. F. A. Novikov, Discrete Mathematics for Computer Programmers [in Russian], Piter, St. Petersburg (2000).

    Google Scholar 

  15. V. B. Kudryavtsev, S. V. Alyoshin, and A. S. Podkolzin, An Introduction to the Theory of Automata [in Russian], Nauka, Moscow (1985).

    Google Scholar 

  16. V. M. Glushkov, “The abstract theory of automata,” Uspekhi Mat. Nauk, XVI, Issue 5, 3–62 (1961).

    MathSciNet  Google Scholar 

  17. B. A. Trakhtenbrot and Ya. M. Bardzin, Finite Automata (Behavior and Synthesis) [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  18. Yu. A. Shikhanovich, Introduction to Modern Mathematics (Initial Concepts) [in Russian], Nauka, Moscow (1965).

    MATH  Google Scholar 

  19. S. I. Baranov and V. A. Sklyarov, Programmable LSI Digital Devices with Array Structure [in Russian], Radio i Svyaz’, Moscow (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Donetsk National Technical University, Krasnoarmiysk, Ukraine

    R. M. Babakov

  2. University of Zielona Góra, Zielona Góra, Poland

    A. A. Barkalov

Authors
  1. R. M. Babakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Barkalov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. M. Babakov.

Additional information

Translated from Kibernetika Sistemnyi Analiz, No. 2, March–April, 2016, pp. 22–29.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Babakov, R.M., Barkalov, A.A. Algebraic Interpretation of a Microprogram Finite-State Machine with Datapath of Transitions. Cybern Syst Anal 52, 191–198 (2016). https://doi.org/10.1007/s10559-016-9814-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-016-9814-5

Keywords

Search

Navigation