This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Amoroso S., Bloom St., A model of a digital computer, Symposium on Computers and Automata, Brooklyn, 1971
de Backer J.W., Recursive procedures, Mathematical Center Tracts 24 Mathematisch Centrum Amsterdam, 1971
de Backer J.W., Scott D., A theory of programs in outline of join work by J.W. de Bakker and Dana Scott, Vienna 1979
Bartol W., Raś Z., Skowron A., Theory of computing systems, to appear
Blikle A., An extended approach to mathematical analysis of programs, CC PAS REPORTS, 1974
Cadiou J.M., Recursive definitions of partial functions and their computations, Stanford University, Report STAN-266-72
Eilenberg S., Automata, languages and machines, Volume A, Academic Press. 1974
Elgot C.C., Robinson A., Random-access stored-program machines, an approach, to programming languages, Journ. ASM, 11, 1964
Kalmar L., Les calculatrices automatiques comme structures algebriques, Previsions, calculs et realites, Paris 1965
Mazurkiewicz A., Proving algorithms by tail functions, Inf. Cont. 18, 220–226, 1971
Mazurkiewicz A., Iteratively computable relations, Bull. Acad. Polon Sci., Ser. Sci. Math. Astronom. Phys. 20, 793–798, 1972
Mitchell B., Theory of categories, Academic Press, 1965
Pawlak Z., On the notion of a computer, Logic. Meth. and Phil. of Science, 255–267, 1968
Pawlak Z., A mathematical model of a digital computer, Proc. Conf. Theory of Autom. and Formal Lang., Boon 1973
Rasiowa H., On ω+-valued algorithmic logic and related problems, Supplement to Proc. of Symp. and Summer School on Mathematical Foundations of Computer Science, High Tatras, September 3–8, 1973
Raś Z., Classification of programs of SPC, Lectures Notes in Computer Science, 3rd Symposium at Jadwisin, June 17–22, 1974
Salwicki A., Formalized algorithmic languages, Bull. Acad. Polon. Sci., Ser. Math. Astronom. Phys. 18, 1972
Wagner E.G., Bounded action machines: toward an abstract theory of computer structure, Journ. of CSS, 2, 13–75, 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raś, Z. (1976). On a relationship between programs of address machines and Mazurkiewicz algorithms. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_216
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_216
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive