Skip to main content
SpringerLink
Log in
Book cover

International Conference on Unconventional Methods of Computation

UMC 2002: Unconventional Models of Computation pp 66–85Cite as

Filtrons of Automata

  • Conference paper
  • First Online:

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

Abstract

Periodic moving coherent structures (particles) are well known in parallel string processing (SP) performed by cellular automata (CAs). In 1986 the discrete soliton-like objects were shown in a filter CA model that performs serial SP. Then, some other systems that support discrete solitons were proposed in nonlinear physics. Now there are iterated arrays, filter CAs, soliton CAs, higher order CAs, sequentially updated CAs, integrable CAs, IIR digital filters, filter transducers, ultradiscrete soliton equations (KdV, KP, L-V), and fast rules. Also, box-ball systems, crystal systems and affine Lie algebras were introduced recently. We show a unified approach to all these processing mechanisms. They are based on iterated automata maps (IAMs). Automaton equivalents to various systems differ on their organization of memory. We show the automata that use various finite and/or infinite memories: shift registers, counters, stacks, FIFO, lists, and pipelines of counters. In our approach the IAMs mimic transmitting media, while filtrons describe propagating coherent disturbances. We mention also various phenomena of interacting filtrons.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ablowitz, M. J., Keiser, J. M., Takhtajan, L. A.: A class of stable multistate time-reversible cellular automata with rich particle content. Physical Review A. 4410 (1991) 6909–6912.

    Article  Google Scholar 

  2. Adamatzky, A. (ed.). Collision-Based Computing. Springer-Verlag, London (2002).

    MATH  Google Scholar 

  3. Atrubin, A. J.: An iterative one-dimensional real-time multiplier. IEEE Trans. on El. Computers. EC-14 (1965) 394–399.

    Article  Google Scholar 

  4. Boccara, N., Nasser, J., Roger, M.: Particle-like structures and their interactions in spatio-temporal patterns generated by one-dimensional deterministic cellular-automaton rules. Physical Review A. 442 (1991) 866–875.

    Article  Google Scholar 

  5. Barrett, C. L., Reidys, C. M.: Elements of a theory of computer simulation I: sequential CA over random graphs. Applied Mathematics and Computation. 98 (1999) 241–259.

    Article  MATH  MathSciNet  Google Scholar 

  6. Bruschi, M., Santini, P. M., Ragnisco, O.: Integrable cellular automata. Physics Letters A. 169 (1992) 151–160.

    Article  MathSciNet  Google Scholar 

  7. Buning, H. K., Priese, L.: Universal asynchronous iterative arrays of Mealy automata. Acta Informatica. 13 (1980) 269–285.

    Article  MathSciNet  Google Scholar 

  8. Delorme, M., Mazoyer, J. (eds.): Cellular Automata. A Parallel Model. Kluwer (1999).

    Google Scholar 

  9. Deqin, Y., Quinghu, H.: The enumeration of preimages and Gardens-of-Eden in sequential cellular automata. Complex Systems. 121 (2000) 83–91.

    MathSciNet  Google Scholar 

  10. Fokas, A. S., Madala, H. R.: Emerging patterns and computational design of filter cellular automata. Complex Systems. 7 (1993) 389–413.

    MATH  MathSciNet  Google Scholar 

  11. Fokas, A. S., Papadopoulu, E. P., Saridakis, Y. G., Ablowitz, M. J.: Interaction of simple particles in soliton cellular automata. Studies inAppl. Mathematics. 81 (1989) 153–180.

    MATH  Google Scholar 

  12. Fokas, A. S., Papadopoulou, E. P., Saridakis, Y. G.: Particles in soliton cellular automata. Complex Systems. 3 (1989) 615–633.

    MATH  MathSciNet  Google Scholar 

  13. Fokas, A. S., Papadopoulou, E. P., Saridakis, Y. G.: Soliton cellular automata. Physica D. 41 (1990) 297–321.

    Article  MATH  MathSciNet  Google Scholar 

  14. Fokas, A. S., Papadopoulou, E. P., Saridakis, Y. G.: Coherent structures in cellular automata. Physics Letters A. 1477 (1990) 369–379.

    Article  MathSciNet  Google Scholar 

  15. Fuchssteiner, B.: Filter automata admitting oscillating carrier waves. Applied Mathematics Letters. 46 (1991) 23–26.

    Article  MATH  MathSciNet  Google Scholar 

  16. Fukuda, K., Okado, M., Yamada, Y.: Energy functions in box ball systems. International Journal of Modern Physics A. 159 (2000) 1379–1392.

    Article  MATH  MathSciNet  Google Scholar 

  17. Goldberg, A. H.: Parity filter automata. Complex Systems. 2 (1988) 91–141.

    MATH  MathSciNet  Google Scholar 

  18. Hatayama, G., Kuniba, A., Okado, M., Takagi, T.: Combinatorial R matrices for a family of crystals: C n (1) and A 2n-1 (2) cases. Progress in Mathematics Vol. 191, Physical Combinatorics. Birkhauser Boston (2000) 105–139.

    Google Scholar 

  19. Hatayama, G., Kuniba, A. Takagi, T.: Simple algorithm for factorized dynamics of the g n -automaton. J. of Physics A: Mathematical and General. 34 (2001) 10697–10705.

    Article  MATH  MathSciNet  Google Scholar 

  20. Hatayama, G., Hikami, K., Inoue, R. Kuniba, A., Takagi, T., Tohikiro, T.: The AM (1) automata related to crystals of symmetric tensors. J. Math. Phys. 42 (2001) 274–308.

    Article  MATH  MathSciNet  Google Scholar 

  21. Hikami, K., Inoue, R.: Supersymmetric extension of the integrable box-ball system. Journal of Physics A: Mathematical and General. 3329 (2000) 4081–4094.

    Article  MATH  MathSciNet  Google Scholar 

  22. Jakubowski, M. H., Steiglitz, K., Squier, R. K.: When can solitons compute? Complex Systems. 10 (1996) 1–21.

    MATH  MathSciNet  Google Scholar 

  23. Jakubowski, M. H., Steiglitz, K., Squier, R. K.: Information transfer between solitary waves in saturable Schrödinger equation. Physical Review E. 566 (1997) 7267–7272.

    Article  Google Scholar 

  24. Jiang, Z.: An energy-conserved solitonic cellular automaton. Journal of Physics A: Mathematical and General. 2511 (1992) 3369–3381.

    Article  MATH  MathSciNet  Google Scholar 

  25. Lindgren, K., Nordal, M. G.: Universal computation in simple one-dimensional cellular automata. Complex Systems. 4 (1990) 299–318.

    MATH  MathSciNet  Google Scholar 

  26. Newell, A.: Solitons in Mathematics and Physics. Soc. for Industrial and App. Math., Philadelphia (1985).

    Google Scholar 

  27. Papatheodorou, T. S., Ablowitz, M. J., Saridakis, Y. G.: A rule for fast computation and analysis of soliton automata. Studies in Applied Mathematics. 79 (1988) 173–184.

    MATH  MathSciNet  Google Scholar 

  28. Papatheodorou, T. S., Fokas, A. S.: Evolution theory, periodic particles and solitons in cellular automata. Studies in Applied Mathematics. 80 (1989) 165–182.

    MATH  MathSciNet  Google Scholar 

  29. Papatheodorou, T. S., Tsantanis, N. B.: Fast soliton automata. In: “Optimal Algorithms”, H. Djidjev (ed.) LNCS vol. 401. Springer-Verlag, Berlin (1989) 41–47.

    Google Scholar 

  30. Park, J. K., Steiglitz, K., Thurston, W. P.: Soliton-like behavior in automata. Physica D. 19 (1986) 423–432.

    Article  MATH  MathSciNet  Google Scholar 

  31. Paun, G.: On the iteration of gsm mappings. Revue Roumaine de Mathematiques pures et Appliquees. 23 (1978) 921–937.

    MATH  MathSciNet  Google Scholar 

  32. Paun, G.: On controlled iterated gsm mappings and related operations. Revue Roumaine de Mathematiques pures et Appliquees. 25 (1980) 139–145.

    Google Scholar 

  33. Siwak, P.: Introduction to filter automata theory. Studia z Automatyki, 18 (1993) 87–110.

    MathSciNet  Google Scholar 

  34. Siwak, P.: Filtrons and their associated ring computations. International Journal of General Systems, 271-3 (1998) 181–229.

    Article  MATH  Google Scholar 

  35. Siwak, P.: On automata of some discrete recursive filters that support the filtrons. Proceedings of the Fifth International Symposium MMAR’98, 25–29 August 1998, Miedzyzdroje, Poland. Eds. S. Domek, R. Kaszynski, L. Tarasiejski. Printed by Wydawnictwo Politechniki Szczecinskiej. Vol. 3 (1998) 1069–1074.

    Google Scholar 

  36. Siwak, P.: Iterons, fractals and computations of automata. In: D. M. Dubois (ed.), CASYS’98 — Second International Conference. Liege, Belgium, August 1998. AIP Conference Proceedings 465. Woodbury, New York (1999) 367–394.

    Google Scholar 

  37. Siwak, P.: On automaton media supporting the filtrons. In: D. M. Dubois (ed.), CASYS’99 — Third International Conference. Liege, Belgium, August 1999. AIP Conference Proceedings 517. Woodbury, New York (2000) 552–573.

    Google Scholar 

  38. Siwak, P.: Soliton-like dynamics of filtrons of cyclic automata, Inverse Problems. 174 (2001) 897–918.

    Article  MATH  MathSciNet  Google Scholar 

  39. Siwak, P.: Automata and filtrons of box-ball and crystal systems. International Journal of Computing Anticipatory Systems. 8 (2001) 386–401.

    Google Scholar 

  40. Siwak, P.: Anticipating the filtrons of automata by complex discrete systems analysis. In: D. M. Dubois (ed.), CASYS’2001 — Fifth International Conference on Computing Anticipatory Systems., HEC Liege, Belgium, August 13–18, 2001. AIP Conference Proceedings 627. Woodbury, New York (2002).

    Google Scholar 

  41. Siwak, P.: Iterons of automata. In: Collision-Based Computing. A. Adamatzky (ed.), Springer-Verlag, London (2002) 299–354.

    Google Scholar 

  42. Steiglitz, K., Kamal, I., Watson, A.: Embedding computation in one-dimensional automata by phase coding solitons. IEEE Transactions on Computers. C-37 (1988) 138–145.

    Article  MathSciNet  Google Scholar 

  43. Steiglitz, K.: Time-gated Manakov spatial solitons are computationally universal. Physical Review E. 63, 016608 (21 December 2000).

    Google Scholar 

  44. Steiglitz, K.: Multistable collision cycles of Manakov spatial solitons. Physical Review E. 63, 04407 (26 March 2001).

    Google Scholar 

  45. Takahashi, D.: On a fully discrete soliton system. Proceedings NEEDS’91, Baia Verde, Gallipoli, Italy, 19–29 June 1991. Eds. M. Boiti, L. Martina, F. Pempinelli. World Scientific, Singapore (1991) 245–249.

    Google Scholar 

  46. Takahashi, D.: On some soliton systems defined by using boxes and balls. International Symposium on Nonlinear Theory and Its Applications (NOLTA’93), Hawaii, USA, December 5–10. (1993) 555–558.

    Google Scholar 

  47. Takahashi, D., Matsukidaira, J.: On discrete soliton equations related to cellular automata. Physics Letters A. 209 (1995) 184–188.

    Article  MATH  MathSciNet  Google Scholar 

  48. Takahashi, D., Matsukidaira, J.: Box and ball system with carrier and ultradiscrete modified KdV equation. Journal of Physics A: Mathematical and General. 30,21 (1997) L733–L739.

    Article  MATH  MathSciNet  Google Scholar 

  49. Takahashi, D., Satsuma, J.: A soliton cellular automaton. Journal of the Physical Society of Japan. 59,10 (1990) 3514–3519.

    Article  MathSciNet  Google Scholar 

  50. Takahashi, H.: Information transmission in one-dimensional cellular space and the maximum invariant set. Information and Control. 33 (1977) 35–55.

    Article  MATH  MathSciNet  Google Scholar 

  51. Tokihiro, T., Nagai, A., Satsuma, J.: Proof of solitonical nature of box and ball systems by means of inverse ultra-discretization. Inverse Problems. 15 (1999) 1639–1662.

    Article  MATH  MathSciNet  Google Scholar 

  52. Tokihiro, T., Takahashi, D., Matsukidaira, J.: Box and ball systems as a realization of ultradiscrete nonautonomous KP equation. Journal of Physics A: Mathematical and General. 33,3, (2000) 607–619.

    Article  MATH  MathSciNet  Google Scholar 

  53. Torii, M., Takahashi, D., Satsuma J.: Combinatorial representation of invariants of a soliton cellular automaton. Physica D 923-4 (1996) 209–220.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Control and Information Engineering, Poznan University of Technology, PL Skłodowskiej-Curie 5, 60-965, Poznań, Poland

    Paweł Siwak

Authors
  1. Paweł Siwak
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Siwak, P. (2002). Filtrons of Automata. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45833-6_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44311-7

  • Online ISBN: 978-3-540-45833-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation