Skip to main content

A Statistical Approach to the Identification of Diploid Cellular Automata

  • Conference paper
  • First Online:
Book cover Theory and Practice of Natural Computing (TPNC 2017)

Abstract

In this paper, the identification problem of diploid Cellular Automata is considered, in which, based on a series of observations, the underlying cellular automaton rules are to be uncovered. A solution algorithm based on a statistical parameter estimation method using a normal distribution approximation is proposed. The accuracy of this method is verified in a series of computational experiments.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Adamatzky, A.: Identification of cellular automata. In: Meyers, R.A. (ed.) Computational Complexity: Theory, Techniques, and Applications, pp. 1564–1575. Springer, New York (2012)

    Chapter  Google Scholar 

  2. Bołt, W., Baetens, J.M., De Baets, B.: On the decomposition of stochastic cellular automata. J. Comput. Sci. 11, 245–257 (2015)

    Article  MathSciNet  Google Scholar 

  3. Bołt, W., Wolnik, B., Baetens, J.M., De Baets, B.: On the identification of \(\alpha \)-asynchronous cellular automata in the case of partial observations with spatially separated gaps. In: de Trė, G., Grzegorzewski, P., Kacprzyk, J., Owsiński, J.W., Penczek, W., Zadrożny, S. (eds.) Challenging Problems and Solutions in Intelligent Systems, pp. 23–36. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30165-5_2

    Google Scholar 

  4. Brown, L.D., Cai, T.T., DasGupta, A.: Interval estimation for a binomial proportion. Stat. Sci. 16(2), 101–133 (2001)

    MathSciNet  MATH  Google Scholar 

  5. Das, D.: A survey on cellular automata and its applications. In: Krishna, P.V., Babu, M.R., Ariwa, E. (eds.) ObCom 2011. CCIS, vol. 269, pp. 753–762. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29219-4_84

    Chapter  Google Scholar 

  6. Fatès, N.: Diploid cellular automata: first experiments on the random mixtures of two elementary rules. In: Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E. (eds.) AUTOMATA 2017. LNCS, vol. 10248, pp. 97–108. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-58631-1_8

    Chapter  Google Scholar 

  7. Fatès, N., Morvan, M.: An experimental study of robustness to asynchronism for elementary cellular automata. Complex Syst. 16, 1–27 (2005)

    MathSciNet  MATH  Google Scholar 

  8. Mendonça, J., de Oliveira, M.: An extinction-survival-type phase transition in the probabilistic cellular automaton \(p182-q200\). J. Phys. A: Math. Theor. 44 (2011). Article ID 155001

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Witold Bołt .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bołt, W., Bołt, A., Wolnik, B., Baetens, J.M., De Baets, B. (2017). A Statistical Approach to the Identification of Diploid Cellular Automata. In: Martín-Vide, C., Neruda, R., Vega-Rodríguez, M. (eds) Theory and Practice of Natural Computing. TPNC 2017. Lecture Notes in Computer Science(), vol 10687. Springer, Cham. https://doi.org/10.1007/978-3-319-71069-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71069-3_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71068-6

  • Online ISBN: 978-3-319-71069-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics