This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. L. Bloom and R. Tindell, "Algebraic and graph theoretic characterizations of structured flowchart schemes." To appear in JTCS.
C. C. Elgot and J. C. Shepherdson, "A semantically meaningful characterization of reducible flowchart schemes." To appear in JTCS. Also IBM Research Report RC-6656 (July 1977)
C. C. Elgot, "The external behavior of machines." Proc. of 3rd Hawaii International Conference on System Sciences (1970) also IBM Research Report RC-2740 (December 1969).
C. C. Elgot, "Structured programming with and without GO TO statements," IEEE Trans. on Software Eng. SE-2, No. 1 (March 1976). Erratum and Corrigendum IEEE Trans. on Software Eng. (September 1976).
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elgot, C.C. (1979). A representative strong equivalence class for accessible flowchart schemes. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_39
Download citation
DOI: https://doi.org/10.1007/3-540-09541-1_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09541-5
Online ISBN: 978-3-540-35010-1
eBook Packages: Springer Book Archive