Skip to main content
SpringerLink
Log in

A perimeter-time CA for the queen bee problem

  • Conference paper
Cellular Automata: Research Towards Industry

Abstract

We present a CA for the so-called queen bee problem posed by Smith which is the problem of leader election in arbitrary patterns. The running time of the solution presented is within a factor of 2 of a lower bound.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andreas Beckers. Ein Ansatz zur hierarchischen Programmierung von Zellularautomaten. Diploma thesis, Fakultät für Informatik, Universität Karlsruhe, 1995.

    Google Scholar 

  2. Armin Hemmerling. Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces. In L. Budach, editor, FCT ‘79, pages 167–174, Berlin, 1979. Akademie-Verlag.

    Google Scholar 

  3. Jacques Mazoyer. An overview of the firing squad synchronization problem. In C. Choffrut, editor, Automata Networks, number 316 in LNCS, pages 82–94, Berlin, 1988. Springer.

    Google Scholar 

  4. Jacques Mazoyer and Eric Rémila. Compass permits leader election. Research Report RR 98–04, Ecole Normale Supérieure de Lyon, 1998.

    Google Scholar 

  5. Alvy Ray Smith III. Two-dimensional formal languages and pattern recognition by cellular automata. In IEEE Conference Record of 12 th Annual Symposium on Switching and Automata Theory, pages 144–152. IEEE, 1971.

    Google Scholar 

  6. Roland Vollmar. Algorithmen in Zellularautomaten. Teubner, Stuttgart, 1979.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Universität Karlsruhe, Karlsruhe, Germany

    Andreas Beckers & Thomas Worsch

Authors
  1. Andreas Beckers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Worsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartmento di Scienze dell’Informazione, Università di Milano, via Comelico 39, 20135, Milano, Italy

    S. Bandini

  2. Montecatini Environmental Research Center, Ravenna, Italy

    R. Serra

  3. Illycaffè S.p.A., Trieste, Italy

    F. Suggi Liverani

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag London Limited

About this paper

Cite this paper

Beckers, A., Worsch, T. (1998). A perimeter-time CA for the queen bee problem. In: Bandini, S., Serra, R., Liverani, F.S. (eds) Cellular Automata: Research Towards Industry. Springer, London. https://doi.org/10.1007/978-1-4471-1281-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1281-5_2

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-048-4

  • Online ISBN: 978-1-4471-1281-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation