Skip to main content
Log in

Über die Vernetzungsstruktur von maschinen

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

By adding some technologically motivated postulates to the definition of finite automata, we gain a mathematical model which permits interesting insights into the network structure of computing machines. In particular we show that the design of a strongly wired part (CPU) and a weakly wired part (storage) is advisable from the viewpoint of cost minimisation. We can also deduce some results about the interdependence of wiring density and computation time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literatur

  1. Arbib, M. A.: Theories of abstract automata. Englewood Cliffs (N.J.): Prentice-Hall 1969

    Google Scholar 

  2. Hotz, G.: Informatik: Rechenanlagen. Teubner Studienbuch. Stuttgart: Teubner 1972

    Google Scholar 

  3. Hotz, G., Walter, H.: Automatentheorie und Formale Sprachen, Bd. I, II. Mannheim: Bibliographisches Institut 1968

    Google Scholar 

  4. Spira, P.M.: The time required for group multiplication. J. ACM 16, 235–243 (1969)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaufholz, G. Über die Vernetzungsstruktur von maschinen. Acta Informatica 3, 171–186 (1974). https://doi.org/10.1007/BF00264036

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264036

Navigation