Logical Gates on Gliders in Restricted Space Domain Cellular Automata | SpringerLink
Skip to main content
Springer Nature Link
Log in

Logical Gates on Gliders in Restricted Space Domain Cellular Automata

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12599))

  • 458 Accesses

Abstract

The new approach for logical operations implementations in cellular automata is proposed. For the implementation of logical gates the propagation of the gliders of cellular automata in bounded domain is considered. Special laws for collisions of gliders with domain walls and internal obstacles in domain are displayed. Logical gate XOR construction, examples of computations and some discussion are described. Comparison with usual approach is given.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Illiachinski, A.: Cellular Automata. A Discrete Universe. World Scientific Publishing, Singapore (2001)

    Google Scholar 

  2. Wolfram, S.: New Kind of Science. Wolfram Media Inc., Champaign (2002)

    Google Scholar 

  3. Chopard, B., Droz, M.: Cellular Automata Modeling of Physical Systems. Cambridge University Press, Cambridge (1998)

    Book  Google Scholar 

  4. Adamatszky, A. (ed.): Collision-Based Computing. Springer, London (2002). https://doi.org/10.1007/978-1-4471-0129-1

  5. Cook, M.: Universality in elementary cellular automata. Complex Syst. 15, 1–40 (2004)

    MathSciNet  MATH  Google Scholar 

  6. Adamatzky, A., Durand-Lose, J.: Collision-based computing. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds.) Handbook of Natural Computing, pp. 1949–1978. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-540-92910-9_58

  7. Rennard, J.P.: Implementation of logical functions in the game of life. In: Adamatzky, A. (ed.) Collision-Based Computing, pp. 491–512. Springer, London (2002). https://doi.org/10.1007/978-1-4471-0129-1_17

  8. Faccetti, L., Makarenko, A.: ‘Game of Life’ with modifications: non-regular space, different rules and many hierarchical levels. Int. J. Inf. Content Process. 4(1), 21–50 (2017)

    Google Scholar 

  9. Delahaye, J.P.: L’sutomata des chifferes. Pour la Science 394, 80–85 (2010)

    Google Scholar 

  10. Goldengorin, B., Makarenko, A., Smelyanec, N.: Some applications and prospects of cellular automata in traffic problems. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 532–537. Springer, Heidelberg (2006). https://doi.org/10.1007/11861201_61

    Chapter  Google Scholar 

  11. Sipper, M.: Co-evolving non-uniform cellular automata to perform computation. Physica D 92, 193–208 (1990)

    Google Scholar 

  12. Fates, N.: A Guided Tour of Asynchronous Cellular Automata, pp. 1–33. arXiv:1406.0792v2 (2014)

  13. Dennunzio, A., Formenti, E., Provillard, J.: Non-uniform cellular automata: classes, dynamics and decidability. Inf. Comput. 215, 32–34 (2012)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied System Analysis at National Technical Universities of Ukraine, Igor Sykorski Kiev Polytechnic Institute, Kyiv, Ukraine

    Alexander Makarenko

  2. HD Rain, Paris, France

    Jordan Brajon

Authors
  1. Alexander Makarenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jordan Brajon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Makarenko .

Editor information

Editors and Affiliations

  1. University of Łódź, Lodz, Poland

    Tomasz M. Gwizdałła

  2. Università degli Studi di Trieste, Trieste, Italy

    Luca Manzoni

  3. Democritus University of Thrace, Xanthi, Greece

    Georgios Ch. Sirakoulis

  4. University of Milano-Bicocca, Milan, Italy

    Stefania Bandini

  5. University of Łódź, Lodz, Poland

    Krzysztof Podlaski

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Makarenko, A., Brajon, J. (2021). Logical Gates on Gliders in Restricted Space Domain Cellular Automata. In: Gwizdałła, T.M., Manzoni, L., Sirakoulis, G.C., Bandini, S., Podlaski, K. (eds) Cellular Automata. ACRI 2020. Lecture Notes in Computer Science(), vol 12599. Springer, Cham. https://doi.org/10.1007/978-3-030-69480-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-69480-7_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-69479-1

  • Online ISBN: 978-3-030-69480-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation