Multidimensional cellular automata and generalization of Fekete's lemma

17Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Fekete's lemma is a well-known combinatorial result on number sequences: we extend it to functions defined on d-tuples of integers. As an application of the new variant, we show that nonsurjective d-dimensional cellular automata are characterized by loss of arbitrarily much information on finite supports, at a growth rate greater than that of the support's boundary determined by the automaton's neighbourhood index. © 2008 Discrete Mathematics and Theoretical Computer Science (DMTCS).

Cite

CITATION STYLE

APA

Capobianco, S. (2008). Multidimensional cellular automata and generalization of Fekete’s lemma. Discrete Mathematics and Theoretical Computer Science, 10(3), 95–104. https://doi.org/10.46298/dmtcs.442

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free