Sequential and jumping machines and their relation to computers. (English) Zbl 0244.68027


68Q45 Formal languages and automata
Full Text: DOI


[1] Amoroso, S., Bloom, S.: A model of the digital computer. Proc. Symp. Computers and Automata, Polytechnic Institute of Brooklyn, 539–559 (1972).
[2] Arbib, M. A.: Theories of abstract automata. Prentice-Hall, 1969. · Zbl 0193.32801
[3] Čulík, K.: On semantics of programming languages. In: Automatentheorie und formale Sprachen. Dörr, J. and Hotz, G. (eds.), pp 291–303. Mannheim: Bibl. Inst. 1970.
[4] Čulík, K.: Theory of programming languages and of algorithms. [Czech], textbook for the Czech Institute of Technology in Prague, 100 pp (in press).
[5] Čulík, K.: Combinational problems in theory of complexity of algorithmic nets without cycles for simple computers. Aplikace matematiky (in press).
[6] Elgot, C. C., Robinson, A.: Random-access stored-program machines, an approach to the theory of programming languages. J. Assoc. Comp. Mach. 11, 365–399 (1964). · Zbl 0192.07302
[7] Shepherdson, J. C., Sturgis, H. E.: Computability of recursive functions. J. Assoc. Comp. Mach. 16, 217–255 (1969). · Zbl 0118.25401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.