Abstract
Indecomposable local maps of one-dimensional tessellation automata are studied. The main results of this paper are the following. (1) For any alphabet ∑ containing two or more symbols and for anyn≥ 1, there exist indecomposable scope-n local maps over ∑. (2) If ∑ is a finite field of prime order, then a linear scope-n local map over ∑ is indecomposable if and only if its associated polynomial is an irreducible polynomial of degreen − 1 over ∑, except for a trivial case. (3) Result (2) is no longer true if ∑ is a finite field whose order is not prime.
Similar content being viewed by others
References
S. Amoroso and Y. N. Patt, Decision procedure for surjectivity and injectivity of parallel maps for tessellation structures,J. Comput. System Sci., 6, 448–464 (1972).
C. Berge,Graphs and Hypergraphs, North-Holland Publishing Company, Amsterdam, 1973.
E. R. Berlekamp,Algebraic Coding Theory, McGraw-Hill Book Company, New York, 1968.
G. Birkhoff and T. C. Bartee,Modern Applied Algebra, McGraw-Hill Book Company, New York, 1970.
N. G. deBruijn, A combinatorial problem, Nederl, akad, Wetensh, Proc. 49, 758–764:Indaqutions Math., 8, 461–467 (1946).
F. Harary,Graph Theory, Addison-Wesley, Reading, 1969.
G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system,Math. Systems Theory, 3, 320–375 (1969).
M. Nasu, Local maps inducing surjective global maps of one-dimensional tessellation automata,Math. Systems Theory, 11, 327–351 (1978).
W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, second edition, The MIT Press, 1972.
H. Yamada and S. Amoroso, A completeness problem for pattern generation in tessellation automata,J. Comput. System Sci., 4, 137–176 (1970).
N. Zierler, Linear recurring sequences,J. Soc. Industrial Applied Math., 7, 31–48 (1959).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nasu, M. Indecomposable local maps of tessellation automata. Math. Systems Theory 13, 81–93 (1979). https://doi.org/10.1007/BF01744290
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01744290