Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1993: Fundamentals of Computation Theory pp 406–417Cite as

One-way cellular automata on cayley graphs

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 710))

Abstract

The notion of one-dimensional one-way cellular automata has been introduced to model cellular automata with only a one-way communication between two neighbor cells. In this paper, we generalize this notion to cellular automata working on different communication graphs. We present some necessary and/or sufficient conditions for a cellular automaton to be simulated by a one-way cellular automaton having the same underlying graph, and we give some bounds on the simulation time of this mimic.

This work was partially supported by the Esprit Basic Research Action “Algebraic and Semantical Methods In Computer Science”, by the PRC “Mathématique et Informatique” and by a grant of the French Gouvernement.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Béla Bollobás. Graph Theory: an Introductory Course. Springer Verlag, 1979.

    Google Scholar 

  2. W. Burnside. Theory of groups of finite order. Cambridge, 1987.

    Google Scholar 

  3. A. Cayley. On the theory of groups. Proc. London Math. Soc., 1(9):126–133, 1878.

    Google Scholar 

  4. A. Cayley. The theory of groups: graphical representations. Amer. J. Math., 1:174–176, 1878.

    Google Scholar 

  5. A. Cayley. On the theory of groups. Amer. J. Math., 11:139–157, 1889.

    Google Scholar 

  6. C. Choffrut and K. Culik. On real-time cellular automata and trellis automata. Acta Informatica, 21:393–407, 1984.

    Article  Google Scholar 

  7. C. R. Dyer. One way bounded cellular automata. Information and Control, 44:261–281, 1980.

    Article  Google Scholar 

  8. W. O. J. Moser H. S. M. Coxeter. Generators and relations for discrete groups. Springer Verlag, 2nd edition, 1965.

    Google Scholar 

  9. A. R. Smith III. Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci., 6:233–253, 1972.

    Google Scholar 

  10. Zs. Róka. One-way cellular automata on Cayley graphs. Research Report 93-07, LIP, ENS Lyon, March 1993.

    Google Scholar 

  11. Arthur T. White. Graphs, Groups and Surfaces. North-Holland Mathematics Studies, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de l'Informatique du Parallélisme, Unité de Recherche Associée 1398 du CNRS Ecole Normale Supérieure de Lyon, 46, Allée d'Italie, 69364, Lyon Cedex 07, France

    Zsuzsanna Röka

Authors
  1. Zsuzsanna Röka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Röka, Z. (1993). One-way cellular automata on cayley graphs. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57163-6

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation