Skip to main content
SpringerLink
Log in

An analog to the additive system of cardinals connected with finite 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. J. Myhill, “Recursive equivalence types and combinatorial functions,” Bull. Amer. Math. Soc.,64, (1958).

  2. J. Dekker and J. Myhill, “Recursive equivalence types,” Univ. Calif. Publ. Math., New Ser.,3, No. 3 (1960).

  3. J. C. E. Dekker, Les Fonctions Combinatories et les Isols, Paris (1966).

  4. E. Ellentuck, “A choice-free theory of Dedekind cardinals,” J. Symb. Logic,34 (1969).

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

    Google Scholar 

  6. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    Google Scholar 

Download references

Authors
  1. S. I. Roizen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 22–29, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roizen, S.I. An analog to the additive system of cardinals connected with finite automata. Cybern Syst Anal 13, 166–174 (1977). https://doi.org/10.1007/BF01073304

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation