Skip to main content
SpringerLink
Log in

Cellular Automata on Regular Rooted Trees

  • Conference paper
Implementation and Application of Automata (CIAA 2012)

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

Included in the following conference series:

Abstract

We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J. Comput. System Sci. 6, 448–464 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aubrun, N.: Dynamique symbolique des systèmes 2D et des arbres infinis. Ph.D. thesis, Universitè Paris-Est (2011)

    Google Scholar 

  3. Aubrun, N., Béal, M.-P.: Sofic and Almost of Finite Type Tree-Shifts. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 12–24. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Aubrun, N., Béal, M.P.: Sofic tree-shifts (to appear, 2012)

    Google Scholar 

  5. Ceccherini-Silberstein, T., Coornaert, M.: Cellular Automata and Groups. Springer Monographs in Mathematics, Berlin (2010)

    Google Scholar 

  6. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata

  7. Fiorenzi, F.: Cellular automata and strongly irreducible shifts of finite type. Theoret. Comput. Sci. 299(1-3), 477–493 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kari, J.: Reversibility and surjectivity problems of cellular automata. J. Comput. System Sci. 48(1), 149–182 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lind, D.A., Marcus, B.H.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  10. Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and second-order logic. Theoret. Comput. Sci. 37(1), 51–75 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  11. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1–35 (1969)

    MathSciNet  MATH  Google Scholar 

  12. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria, Università del Sannio, C.so Garibaldi 107, 82100, Benevento, Italy

    Tullio Ceccherini-Silberstein

  2. Institut de Recherche Mathématique Avancée, UMR 7501, Univ. Strasbourg, 7 rue René Descartes, 67084, Strasbourg Cedex, France

    Michel Coornaert

  3. Laboratoire de Recherche en Informatique, UMR 8623, Bât 650 Univ. Paris-Sud 11, Orsay Cedex, 91405, Orsay, France

    Francesca Fiorenzi

  4. Department of Mathematics, Texas A&M University, MS-3368, College Station, TX, 77843-3368, USA

    Zoran Šunić

Authors
  1. Tullio Ceccherini-Silberstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Coornaert
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesca Fiorenzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zoran Šunić
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055, 4169-007, Porto, Portugal

    Nelma Moreira  & Rogério Reis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ceccherini-Silberstein, T., Coornaert, M., Fiorenzi, F., Šunić, Z. (2012). Cellular Automata on Regular Rooted Trees. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31606-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31605-0

  • Online ISBN: 978-3-642-31606-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation