Efficient exhaustive listings of reversible one dimensional cellular automata

Theoretical Computer Science

Volumn 325, Issue 2 SPEC. ISS., 2004, Pages 215-247

  Boykett, Tim ^a,b  

^a Time's Up Research Department   (Austria)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Algebraic models; Exhaustive enumeration; Graph models; One dimensional cellular automata; Orderly algorithm

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL METHODS; FORMAL LANGUAGES; GRAPH THEORY; MATHEMATICAL MODELS;

ALGEBRAIC MODELS; EXHAUSTIVE ENUMERATION; GRAPH MODELS; ONE DIMENSIONAL CELLULAR AUTOMATA; ORDERLY ALGORITHM;

AUTOMATA THEORY;

EID: 4444303051     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.06.007     Document Type: Article

References (42)

1. Amaroso S., Patt Y.N. Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J. Comp. Systems Sci. 6:1972;448-464.
2. Charles H. Bennett, Logical reversibility of computation, IBM J. Res. Dev., November 1973, pp. 525-532.
3. Tim Boykett, Algebraic aspects of reversible computation, Ph.D. Thesis, University of Western Australia, 1997.
4. Tim Boykett, Towards a Noether-like conservation law theorem for one dimensional reversible cellular automata, available as http://www.arxiv.org/abs/nlin.CG/0312003, 2003, submitted.
5. Tim Boykett, Cris Moore, Commuting cellular automata, Complex Systems (1997) 55-64.
6. A. Drisko Arthur, Moore Cris Algebraic properties of the block transformation on cellular automata. Complex Systems. 10:1996;185-194.
7. Trevor Evans, Products of points - some simple algebras and their identities, Am. Math. Monthly (1967) 362-372.
8. M.A. Fiol, I. Alegra, J.L.A. Yebra, J. Fàbrega, Digraphs with walks of equal lengths between vertices, In: Y. Alavi, G. Chartrand, L. Lesnick, D.R. Lick, C.E. Wall (Eds.), Graph Theory with Applications to Algorithms and Computer Science, Wiley, 1985, pp. 313-322.
9. Gelernter David Generative communication in Linda. ACM Trans. Prog. Lang. Systems. 7(1):1985;80-112.
10. Guggenberger W., Rung J. L-Gruppoide. algebraische und topologische Eigenschaften spezielle Gruppoide Contributions Algebra Geom. 44(1):2003;263-283.
11. Hillman David The structure of reversible one-dimensional cellular automata. Physica D. 52:1991;277-292.
12. Hoffman A.J. Research problem 2-11. J. Combin. Theory. 2:1967;393.
13. J. Kari, On the inverse neighbourhood of reversible cellular automata, In: G. Rosenberg, A. Salomaa (Eds.), Lindenmayer Systems, Impact in Theoretical Computer Science, Computer Graphics and Developmental Biology, 1992, pp. 477-495.
14. Kari J. Reversibility of 2D cellular automata is undecidable. Physica D. 45:1993;379-385.
15. E. Knuth Donald Notes on central groupoids. J. Combin. Theory. 8:1970;376-390.
16. m = dI+λ J Lin. Alg. Appl. 12:1975;139-150.
17. m = dI+λ J J. Combin. Theory Ser. A. 29:1977;140-147.
18. Länger H. Induced groupoids and induced semigroups. Kautschitsch Hermann, et al. Contributions to General Algebra. 1979;177-186 Verlag Johannes Heyn, Klagenfurt.
19. Le Bruyn L., Van Den Bergh M. Algebraic properties of linear cellular automata. Linear Algebra Appl. 157:1991.
20. m = dI+λ J Lin. Alg. Appl. 62:1984;155-161.
21. B.D. McKay, nauty user's guide, Tech. Report, Department of Computer Science, Australian National University, 1990.
22. McKay B.D. Isomorph-free exhaustive generation. J. Algorithms. 26:1998;306-324.
23. McLean David Idempotent semigroups. Amer. Math. Monthly. 64:1954;110-113.
24. N.S. Mendelsohn, Directed graphs with the unique path property, In: P. Erdos, A. Renyi, Vera T. Sos (Eds.), Combinatorial Theory and its Applications, Vol. 4, Colloquia Mathematica Societatis Janos Bolyai, 1970, pp. 783-799.
25. Moore Cris Quasi-linear cellular automata. Physica D. 103:1997;100-132.
26. Moore Cris Predicting non-linear cellular automata quickly by decomposing them into linear ones. Physica D. 111:1998;27-41.
27. Morita Kenichi, Harao Masateru Computation universality of one-dimensional reversible (injective) cellular automata. Trans. IEICE E. 72(6):1989;758-762.
28. D.E. Otero, Extraction of the m th roots in matrix rings over fields, Lin. Alg. Appl. 128 (1990) 1-26.
29. Pedersen John Cellular automata as algebraic systems. Complex Systems. 6:1992;237-250.
30. Pilz G.ünter Near-rings. Mathematics Studies. Vol. 23:1983;North-Holland, Amsterdam.
31. Read R.C. Every one a winner. Ann. Discrete Math. 2:1978;107-120.
32. Richardson D. Tesselations with local transformations. J. Comp. Systems Sci. 6:1972;373-388.
33. F. Royle Gordon An orderly algorithm and some applications in finite geometry. Discrete Math. 185:1998;105-115.
34. 2 = J Lin. Alg. Appl. 3:1970;451-460.
35. Martin Schönert et al., GAP, groups algorithms and programming, Technical Report, Lehrstuhl D für Mathematik, RWTH Aachen, 1994.
36. E. Shader Leslie On the existence of finite central groupoids of all possible ranks. J. Combin. Theory Ser A. 16:1974;221-229.
37. L.H. Soicher, GRAPE: a system for computing with graphs and groups, In: L. Finklestein, W.M. Kantor (Eds.), Groups and Computation, Vol. 11, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Providence, RI, 1993, pp. 287-291.
38. Toffoli Tommaso, H. Margolus Norman Invertible cellular automata. a review Physica D. 45:1993;229-253.
39. W.T. Tutte, Graph Theory, Encyclopedia of Mathematics and its Applications, Vol. 21, Combinatorics, Cambridge University Press, Cambridge, 2001.
40. Vorhees, A note on injectivity of additive cellular automata, Complex Systems 8 (1994) 151-159.
41. m = λ J J. Combin. Theory Ser. A. 29:1980;134-141.
42. m = λ J J. Combin. Theory Ser. A. 33:1982;287-296.