Skip to main content
SpringerLink
Log in

A method of analysis of abstract automata using equations in the algebra of events

  • Published:
Cybernetics Aims and scope

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

References

  1. V. G. Bodnarchuk, “Systems of equations in the algebra of events,” Zhurnal vychislitel'noi matematicheskoi fiziki, vol. 3, no. 6, pp. 1077–1088, 1963.

    Google Scholar 

  2. D. N. Arden, “Delayed logic and finite state machines,” In: Theory of Computing Machine Design, Univ. of Michigan Press, Ann Arbor, 1–35, 1960.

    Google Scholar 

  3. V. M. Glushkov, “The abstract theory of automata,” Uspekhi matematicheskikh nauk, vol. 16, no. 5, pp. 3–62, 1961.

    Google Scholar 

Download references

Authors
  1. M. A. Spivak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 1, No. 1, p 28, 1965

Rights and permissions

Reprints and permissions

About this article

Cite this article

Spivak, M.A. A method of analysis of abstract automata using equations in the algebra of events. Cybern Syst Anal 1, 25–26 (1965). https://doi.org/10.1007/BF01071440

Download citation

  • Issue Date:

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

Keywords

Search

Navigation