On the Completeness of Functions Having Delays
This paper studies completeness conditions for a certain class of automata without feedbacks — so-called functions with delays . The problems considered in the paper are related to investigations begun in  and to an obvious degree are a continuation of them.
KeywordsFinite System Duality Principle Unitary Delay Closed Classis Nonmonotonic Function
Unable to display preview. Download preview PDF.
- 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.S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, Logic Algebra Functions and Post Classes, Nauka, Moscow (1966).Google Scholar
- 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.E. L. Post, Two-Valued Interactive Systems of Mathematical Logic, Princeton (1941).Google Scholar