Infix, cut and finite automata

ABSTRACT

The behavior of one and two dimensional automata are displayed in two and three dimensions and via animations. Implementations of finite automata in J using “infix” and “cut” to distribute local definitions of finite automata are compared. Abstract automata are considered along with applications to image processing and surface plotting.

REFERENCES

• 1: E.R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways for Your Mathematical Plays, Academic Press, New York, 1982.
• 2: C. Burke, j, User Manual, Iverson Software Inc., Toronto, 1994.
• 3: K.E. Iverson, J, Introduction and Dictionary, Iverson Software Inc., Toronto, Canada, 1994.
• 4: Y. Kayama, M. Tabuse, H. Nishimura, and T. Horiguchi, Characteristic Parameters and Classification of One-dimensional Cellular Automata, Chaos, Solitons & Fractals, 3 6 (1993), 651-665.
• 5: C. Linton, From Pentagons and Plasma Clouds to Cliff Dwellers (Part 1) Gimme Arrays! i 6 (1994), 1,7-10, (Part II) 1 7 (1994), 1,7-8,16.
• 6: D. Peak, M. Frame, Chaos Under Control, Freeman, New York, 1994.
• 7: C.A. Reiter, Fractals RYIJ, Vector, 11 2 (1994).
• 8: C.A. Reiter, Fractals, Visualization and J, (expected 1995).
• 9: Tim Wegner, Image lab, Waite Group Press, Corte Madera, CA, 1992
• 10: S. Wolfram, Theory and Applications of Cellular Automata, World Scientific, Singapore, 1986.

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: J

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: APL
      D.3.3 Language Constructs and Features
          Subjects: Procedures, functions, and subroutines

  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

General Terms:
Algorithms, Languages