Abstract
The concept of a structured Turing machine is introduced. Every Turing machine is demonstrated to be equivalent to some structured Turing machine. Various refinements of the problem of structurization are considered and, in particular, refinements in which any extension of the working alphabet being used is prohibited.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Kibernetika, No. 5, 3-10 (1965).
O.-J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, Structured Programming, Academic Press, London-New York (1972).
C. Bohm and G. Jacopini, “Flow diagrams, Turing machines, and languages with only two formation rules,” Comm. ACM, 9, No. 5, 366-371 (1966).
D. Harel, “On folk theorems,” Comm. ACM, 23, No. 7, 379-389 (1980).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
L. P. Lisovik and V. N. Red'ko, Algorithms and Formal Systems [in Russian], Izd. KGU, Kiev (1981).
L. P. Lisovik, “Schemes of programs and transducers over labeled trees,” in: S. V. Yablonskii (ed)., Mathematical Questions of Cybernetics, Vol. 6, Nauka, Moscow (1996), pp. 281-320.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lisovik, L.P. Structured Turing Machines. Cybernetics and Systems Analysis 40, 162–168 (2004). https://doi.org/10.1023/B:CASA.0000034441.56723.a4
Issue Date:
DOI: https://doi.org/10.1023/B:CASA.0000034441.56723.a4