Structured Turing Machines

Authors:
L. P. Lisovik
Affiliations:
Taras Shevchenko University, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2004

Citing 3
Cited 0

On folk theorems

Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
Structured programming

Structured programming

Quantified Score

Hi-index	0.00

Visualization

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.