On the recognizability of self-generating sets

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let I be a finite set of integers and F be a finite set of maps of the form n ↔k i n+ i with integer coefficients. For an integer base k ≥2, we study the k-recognizability of the minimal set X of integers containing I and satisfying Φ (X)⊆X for all Φ ∈ F. In particular, solving a conjecture of Allouche, Shallit and Skordev, we show under some technical conditions that if two of the constants k i are multiplicatively independent, then X is not k-recognizable for any k≤ 2. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kärki, T., Lacroix, A., & Rigo, M. (2009). On the recognizability of self-generating sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5734 LNCS, pp. 525–536). https://doi.org/10.1007/978-3-642-03816-7_45

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