Abstract
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.
Original article submitted November 15, 1968.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature Cited
V. B. Kudryavtsev, “Completeness theorem for a certain class of automata without feedbacks,” in: Problemy Kibernetiki, No. 8, Fizmatgiz, Moscow (1962).
S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, Logic Algebra Functions and Post Classes, Nauka, Moscow (1966).
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).
E. L. Post, Two-Valued Interactive Systems of Mathematical Logic, Princeton (1941).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1973 Consultants Bureau, New York
About this chapter
Cite this chapter
Biryukova, L.A., Kudryavtsev, V.B. (1973). On the Completeness of Functions Having Delays. In: Lyapunov, A.A. (eds) Systems Theory Research. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-0079-4_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0079-4_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-0081-7
Online ISBN: 978-1-4757-0079-4
eBook Packages: Springer Book Archive