✦ LIBER ✦

σ-Automata and Chebyshev-polynomials

✍ Scribed by Klaus Sutner

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 192 KB
Volume: 230
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00242-9

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Schützenberger groups and Chebyshev poly

Schützenberger groups and Chebyshev polynomials

✍ K. D. Magill; S. Schanuel 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 241 KB

Chebyshev polynomials and spectral metho

Chebyshev polynomials and spectral methods

📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 130 KB

Generalization of Chebyshev polynomials

✍ I. E. Shparlinskii 📂 Article 📅 1990 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 148 KB

Chebyshev polynomials for operators

✍ Ernst Albrecht 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 124 KB

Spanning tree formulas and chebyshev pol

Spanning tree formulas and chebyshev polynomials

✍ F. T. Boesch; H. Prodinger 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 501 KB

On σ-polynomials

✍ Shao-Ji Xu 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 612 KB

In this paper, the properties of o-poiynirnuals and quadratic a-polynomials are discussed. An alternative characterization for a quadratic a-Flynomial to be a u-polynomial of a graph is given. The number of graphs having same quadratic o-polynomial CT\* + au + b and the number of quadratic u-polynom