Skip to main content
SpringerLink
Log in

Some remarks about the “efficiency” of polyautomata

  • Published:
International Journal of Theoretical Physics Aims and scope Submit manuscript

Abstract

A proposal is made to measure the “efficiency” of cellular algorithms, implemented in cellular automata, roughly speaking by the ratio of the number of proper state changes and the product of time, and number of single automata. Such a definition is discussed in some detail. For some cellular algorithms lower bounds for their efficiency are given.

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

Access this article

Log in via an institution

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

References

  • Balzer, R. M. (1967). “An 8-State Minimal Time Solution to the Firing Squad Synchronization Problem,”Information and Control,10, 22–42.

    Google Scholar 

  • Hennie, F. C. (1965). “One-Tape, Off-Line Turing Machine Computations,”Information and Control,8, 553–578.

    Google Scholar 

  • Salomaa, A. (1973).Formal Languages. Academic Press, New York and London.

    Google Scholar 

  • Schönhage, A. (1980). Personal communication.

  • Seutter, F. (1981). “Zustandsänderungszahlen bei speziellen Synchronisationsproblemen.” Diploma Thesis, Technical University Braunschweig, Braunschweig.

    Google Scholar 

  • Smith III, A. R. (1970). “Cellular Automata and Formal Languages,Proceedings of Eleventh Annual IEEE Symposium on Switching and Automata Theory, pp. 216–224.

  • Trachtenbrot, B. A. (1977).Algorithmen und Rechenautomaten. VEB Deutscher Verlag der Wissenschaften, Berlin.

    Google Scholar 

  • Vollmar, R. (1979).Algorithmen in Zellularautomaten. Teubner, Stuttgart.

    Google Scholar 

  • Vollmar, R. (1981). “On Cellular Automata with a Finite Number of State Changes,Computing, Supplementum,3, 181–191.

    Google Scholar 

  • Waksman, A. (1966). “An Optimum Solution to the Firing Squad Synchronization Problem,”Information and Control,9, 66–78.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Braunschweig, Braunschweig, Federal Republic of Germany

    R. Vollmar

Authors
  1. R. Vollmar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vollmar, R. Some remarks about the “efficiency” of polyautomata. Int J Theor Phys 21, 1007–1015 (1982). https://doi.org/10.1007/BF02084165

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation