Skip to main content
SpringerLink
Log in

Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata

  • Conference paper
Cellular Automata (ACRI 2006)

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

Included in the following conference series:

Abstract

This paper reports classification of CA (cellular automata) rules targeting efficient synthesis of reversible cellular automata. An analytical framework is developed to explore the properties of CA rules for 3-neighborhood 1-dimensional CA. It is found that in two-state 3-neighborhood CA, the CA rules fall into 6 groups depending on their potential to form reversible CA. The proposed classification of CA rules enables synthesis of reversible CA in linear time.

This work is supported by sponsored CA Research Projects, Department of CST, Bengal Engineering & Science University, Shibpur, India.

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. Cattel, K., Muzio, J.C.: Synthesis of One Dimensional Linear Hybrid Cellular Automata. IEEE Trans. on CAD 15, 325–335 (1996)

    Google Scholar 

  2. Pal Chaudhuri, P., Roy Chowdhury, D., Nandi, S., Chatterjee, S.: Additive Cellular Automata – Theory and Applications, vol. 1. IEEE Computer Society Press, California (1997)

    MATH  Google Scholar 

  3. Das, S.: Theory and A pplications of Nonlinear C ellular Automata I n VLSI Design. PhD thesis, Bengal Engineering And Science University, Shibpur (2006)

    Google Scholar 

  4. Das, S., Kundu, A., Sikdar, B.K., Chaudhuri, P.P.: Design of Nonlinear CA Based TPG Without Prohibited Pattern Set In Linear Time. Journal of Electronic Testing: Theory and Applications 21, 95–109 (2005)

    Article  Google Scholar 

  5. Das, S., Sikdar, B.K., Chaudhuri, P.: Characterization of Reachable/Nonreachable Cellular Automata States. In: Proceedings of Sixth International Conference on Cellular Automata for Research and Industry, ACRI 2004, The Netherlands, October 2004, pp. 813–822 (2004)

    Google Scholar 

  6. Margara, L., Mauri, G., Cattaneo, G., Formenti, E.: On the dynamical behavior of chaotic cellular automata. Theoretical Computer Science 217, 31–51 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Toffoli, T., Margolus, N.H.: Invertible cellular automata: A review. Physica D 45, 229–253 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601–644 (1983)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Technology, Bengal Engineering & Sc. University, Shibpur, Howrah, 711103, India

    Sukanta Das

  2. Dept. of Computer Sc. & Technology, Bengal Engineering & Sc. University, Shibpur, Howrah, 711103, India

    Biplab K. Sikdar

Authors
  1. Sukanta Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Biplab K. Sikdar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Mathematics, Physics and Systems, University of Perpignan, 52, Paul Alduy Avenue, 66860, Perpignan, Cedex, France

    Samira El Yacoubi

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Research Center on Complex Systems and Artificial Intelligence (CSAI) Department of Computer Science, Systems and Communication (DISCo), University of Milan, Bicocca viale Sarca, 336, 20126, Milan, (Italy)

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Das, S., Sikdar, B.K. (2006). Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds) Cellular Automata. ACRI 2006. Lecture Notes in Computer Science, vol 4173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861201_11

Download citation

  • DOI: https://doi.org/10.1007/11861201_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40929-8

  • Online ISBN: 978-3-540-40932-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation