Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5227))

Included in the following conference series:

Abstract

Discrete dynamical systems based on dependency digraphs play an important role in the mathematical theory of computer simulation. In this paper, we are concerned with word-updating dynamical systems (WDS) on digraphs, which is a generalization of sequential dynamical systems (SDS) on graphs defined by Barrett et al. By defining an equivalence relation, we obtain the number of different WDS for the given dependency digraph and local functions. It is shown that WDS with the NOR function are closely related to combinatorial properties of the dependency digraphs.

Supported by the Chenguang Project in Shanghai City (2008CG40).

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Barrett, C.L., Mortveit, H.S., Reidys, C.M.: Elements of a Theory of Computer Simulation II: Sequential Dynamical Systems. Appl. Math. Comput. 107, 121–136 (2002)

    Article  MathSciNet  Google Scholar 

  2. Barrett, C.L., Mortveit, H.S., Reidys, C.M.: Elements of a Theory of Computer Simulation III: Equivalence of SDS. Appl. Math. Comput. 122, 325–340 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barrett, C.L., Mortveit, H.S., Reidys, C.M.: ETS IV: Sequential Dynamical Systems: Fixed Points, Invertibility and Equivalence. Appl. Math. Comput. 134, 153–171 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Barrett, C.L., Reidys, C.M.: Elements of a Theory of Computer Simulation I: Sequential CA over Random Graphs. Appl. Math. Comput. 98, 241–259 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bergeron, F., Labelle, G., Leroux, P.: Combinatorial Species and Tree-like Structures. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  6. Bollobás, B.: Graph Theory: An Introductory Course. Springer, New York (1979)

    MATH  Google Scholar 

  7. Bondy, J.A., Murty, U.S.R.: Graph Theory with Its Applications. Elsevier Science Ltd, New York (1976)

    Google Scholar 

  8. Mortveit, H.S., Reidys, C.M.: Discrete, Sequential Dynamical Systems. Discrete Math. 226, 281–295 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Reidys, C.M.: On Acyclic Orientations and Sequential Dynamical Systems. Adv. in Appl. Math. 27, 790–804 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Donald C. Wunsch II Daniel S. Levine Kang-Hyun Jo

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D., Zheng, J., Wu, X. (2008). Computer Simulation and Word-Updating Dynamical Systems (WDS) on Digraphs . In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85984-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85983-3

  • Online ISBN: 978-3-540-85984-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics