Skip to main content
SpringerLink
Log in

Representability in deterministic multi-tape 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

Literature Cited

  1. M. O. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Res. and Dev.,3, 2, 1959.

    Google Scholar 

  2. C. C. Elgol and F. E. Mezei, “On relations defined by generalized finite automata,” IBM J. Res. and Dev.,9, 1, 1965.

    Google Scholar 

  3. A. L. Rosenberg, “Nonwriting extensions of finite automata,” Harvard University, Cambridge, Massachusetts, report NOBL-39, 1965.

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

    Google Scholar 

Download references

Authors
  1. A. Ya. Makarevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. D. Stotskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Institute of Automation and Telemechanics, Moscow. Translated from Kibernetika, Vol. 5, No. 4, pp. 29–38, July–August, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Makarevskii, A.Y., Stotskaya, E.D. Representability in deterministic multi-tape automata. Cybern Syst Anal 5, 390–399 (1969). https://doi.org/10.1007/BF01073050

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation