论文信息 - On a Relationship Between Programs of Address Machines and Mazurkiewicz Algorithms - 字舞流文

On a Relationship Between Programs of Address Machines and Mazurkiewicz Algorithms

Zbigniew W. Ras

[1] B. Mitchell,et al. Theory of categories , 1965 .

[2] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[3] Eric G. Wagner. Bounded Action Machines: Toward an Abstract Theory of Computer Structure , 1968, J. Comput. Syst. Sci..

[4] Antoni W. Mazurkiewicz,et al. Proving Algorithms by Tail Functions , 1971, Inf. Control..

[5] Zdzislaw Pawlak,et al. A mathematical model of digital computers , 1973, Automatentheorie und Formale Sprachen.

[6] Zdzisław Pawlak. On the Notion of a Computer , 1968 .

[7] J. M. Cadiou,et al. Recursive definitions of partial functions and their computations , 1972, Proving Assertions About Programs.

[8] Abraham Robinson,et al. Random-Access Stored-Program Machines, an Approach to Programming Languages , 1964, JACM.