Skip to main content
SpringerLink
Log in

Recursive-determinate abstract 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. D. J. Rosenkrantz and R. E. Stearns, “Properties of deterministic topdown grammars,” Inform. Control,17, 226 (1970).

    Google Scholar 

  2. V. M. Glushkov, “Abstract theory of automata,” Usp. Mat. Nauk,16, No. 5, 3 (1961).

    Google Scholar 

  3. L. P. Lisovik, “The equivalence problem for finite-ambiguous finite automata on semigroups,” Kibernetika, No. 4, 24 (1979).

    Google Scholar 

  4. L. P. Lisovik, “Strict sets and finite coverings of semigroups,” Kibernetika, No. 1, 12 (1980).

    Google Scholar 

  5. H. Yamada, “Real-time computations and recursive functions noncomputable in real time,” in: Problems of Mathematical Logic [Russian translation], Moscow (1970), pp. 139–155.

  6. M. Blum, “Machine-independent theory of the complexity of recursive functions,” in: Problems of Mathematical Logic [Russian translation], Moscow (1970), pp. 401–422.

  7. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

Download references

Authors
  1. L. P. Lisovik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 36–41, March–April, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisovik, L.P. Recursive-determinate abstract automata. Cybern Syst Anal 17, 195–201 (1981). https://doi.org/10.1007/BF01069633

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation