Skip to main content
SpringerLink
Log in

On dual automata

  • 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. M. O. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Research Develop., vol. 3, pp. 114–125, 1959.

    Google Scholar 

  2. M. A. Spivak, “A new algorithm for abstract synthesis of automata,” Proceedings of Scientific Seminars on Cybernetics, Theory of Automata [in Russian], no. 3, Kiev, 1963.

  3. M. A. Spivak, “An algorithm for abstract synthesis of automata for an extended language of regular expressions,” Izvestiya AN SSSR. Tekhnicheskaya kibernetika, no. 1, 1965.

  4. J. A. Brzozowski, “Derivatives of regular expressions,” J. of the Association for Computing Machinery, 11, 4, 1964.

    Google Scholar 

  5. V. G. Bodnarchuk, “Systems of equations in the algebra of events,” Zhurnal vychislitel'noy matematiki í matematicheskoy fiziki, 3, 6, 1963.

    Google Scholar 

  6. O. B. Lupanov, “A comparison of two types of finite sources,” Problemy kibernetiki, no. 9, 1963.

Download references

Author information

Authors and Affiliations

  1. Saratov State University, Saratov, USSR

    B. G. Mirkin

Authors
  1. B. G. Mirkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 2, No. 1, pp. 7–10, 1966

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mirkin, B.G. On dual automata. Cybern Syst Anal 2, 6–9 (1966). https://doi.org/10.1007/BF01072247

Download citation

  • Issue Date:

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

Keywords

Search

Navigation