Autor:	Čulík, Karel, Arbib, Michael
Zdroj:	Acta Informatica; 1973, Vol. 2 Issue 2, p162-171, 10p
Abstrakt:	We consider sequential and jumping machines as generalized computers, and note that complexity bounds on internal operations are required to distinguish the two classes. We then place these notions, as well as tesselation automata, in the framework of a general definition of parallel stored program machines. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink