Abstract
It is shown that the scheme of any iterative algorithm (program) can be realized by a do-while statement with a switch statement as its body that realizes the finite-state automaton transition graph constructed formally by the given scheme. This realization is simpler than that by the Ashcroft–Manna method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Shalyto, A.A., SWITCH-tekhnologiya. Algoritmizatsiya i programmirovanie zadach logicheskogo upravleniya (SWITCH Technology: Algorithmization and Programming of Logical Control Problems), St. Petersburg: Nauka, 1998.
Shalyto, A.A. and Tukkel', N.I., SWITCH Technology: An Automaton Approach to Developing Software for Reactive Systems, Promyshlennye ASU i Kontrollery, 2000, no. 10.
Shalyto, A.A., Logicheskoe upravlenie. Metody apparatnoi i programmnoi realizatsii algoritmov (Logical Control: Methods for Hardware and Software Implementation of Algorithms), St. Petersburg: Nauka, 2000.
Kuznetsov, B.P., The Psychology of Automaton Programming, BYTE/Russia, 2000, no. 11.
Kazakov, M.A. and Stolyar, S.E., Algorithm Visualizers as a Technological Unit of Teaching Discrete Mathematics and Programming, Proc. Int. Sci.-Methodical Conf. Telematics 2000, St. Petersburg, 2000.
Corman, Th., Leiserson, Ch., and Rivest, R., Introduction to Algorithms, Cambridge, MA: MIT Press, 1990. Translated under the title Algoritmy. Postroenie i analiz, Moscow: MTsNMO, 1999.
Ashcroft, E. and Manna, Z., The Translation of GOTO Programs into WHILE Programs, Proc. IFIP Congress, 1972, vol. 1, pp. 250-255.
Yourdon, E., Techniques of Program Structure and Design, Englewood Cliffs, NJ: Prentice Hall, 1976. Translated under the title Strukturnoe programmirovanie i konstruirovanie program, Moscow: Mir, 1979.
Baranov, S.I., Sintez mikroprogrammnykh avtomatov (graf-skhemy i avtomaty) (Synthesis of Microprogram Automata: Flowgraphs and Automata), Leningrad: Energiya, 1979.
Linger, R., Mills, H., and Witt, B., Structured Programming: Theory and Practice, Reading, MA: Addison-Wesley, 1979. Translated under the title Teoriya i praktika strukturnogo programmirovaniya, Moscow: Mir, 1982.
Kazakov, M.A., Shalyto, A.A., and Tukkel', N.I., Application of the Automaton Approach to Implemetation of Computational Algorithms, Proc. Int. Sci.-Methodical Conf. Telematics 2001, St. Petersburg, 2001.
Stankevich, L.A., Intellektual'nye tekhnologii predstavleniya znanii. Intellektual'nye sistemy (Intelligent Technologies for Knowledge Representation: Knowledge-Based Systems), St. Petersburg: SPSTU, 2000.
Shalyto, A.A., The Use of Algorithm Flowgraphs and Transition Graphs in Program Realization of Logical Control Algorithms, Avtom. Telemekh., 1996, nos. 6-7.
Lyubchenko, V.S., We Are Choosing and Being Chosen... (On the Problem of Algorithmic Model Choosing, Mir PK), 1999, no. 3.
Brookshear, G., Computer Science: An Overview, Reading, MA: Addison Wesley, 1999. Translated under the title Vvedenie v komp'yuternye nauki, Moscow: Vil'yams, 2001.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shalyto, A.A., Tukkel', N.I. Translating Iterative Algorithms into Automaton Ones. Programming and Computer Software 28, 250–260 (2002). https://doi.org/10.1023/A:1020208127964
Issue Date:
DOI: https://doi.org/10.1023/A:1020208127964