On the Completeness of Functions Having Delays

  • L. A. Biryukova
  • V. B. Kudryavtsev


This paper studies completeness conditions for a certain class of automata without feedbacks — so-called functions with delays [1]. The problems considered in the paper are related to investigations begun in [1] and to an obvious degree are a continuation of them.


Finite System Duality Principle Unitary Delay Closed Classis Nonmonotonic Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    V. B. Kudryavtsev, “Completeness theorem for a certain class of automata without feedbacks,” in: Problemy Kibernetiki, No. 8, Fizmatgiz, Moscow (1962).Google Scholar
  2. 2.
    S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, Logic Algebra Functions and Post Classes, Nauka, Moscow (1966).Google Scholar
  3. 3.
    S. V. Yablonskii, Functional Constructions in k-Valued Logic, Transactions of the V. A. Steklov Mathematics Institute of the Academy of Sciences, Vol. 51 (1958).Google Scholar
  4. 4.
    E. L. Post, Two-Valued Interactive Systems of Mathematical Logic, Princeton (1941).Google Scholar

Copyright information

© Consultants Bureau, New York 1973

Authors and Affiliations

  • L. A. Biryukova
    • 1
  • V. B. Kudryavtsev
    • 1
  1. 1.MoscowRussia

Personalised recommendations