-Automata and Chebyshev-polynomials

From MaRDI portal
Publication:1978501





A \(\sigma\)-automaton is an additive, binary cellular automaton on a graph. For product graphs such as grids and cylinders, reversibility and periodicity properties of the corresponding \(\sigma\)-automaton can be expressed in terms of a binary version of Chebyshev polynomials. We give a detailed analysis of the divisibility properties of these polynomials and apply our results to the study of \(\sigma\)-automata.




Cited in
(31)








This page was built for publication: \(\sigma\)-Automata and Chebyshev-polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978501)