An analogue of Cobham's theorem for graph directed iterated function systems (Q2346036): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.aim.2015.04.008 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2015.04.008 / rank
 
Normal rank

Latest revision as of 02:57, 18 December 2024

scientific article
Language Label Description Also known as
English
An analogue of Cobham's theorem for graph directed iterated function systems
scientific article

    Statements

    An analogue of Cobham's theorem for graph directed iterated function systems (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2015
    0 references
    The authors extend a result by \textit{D.-J. Feng} and \textit{Y. Wang} [Adv. Math. 222, No. 6, 1964--1981 (2009; Zbl 1184.28013)], which states that two homogeneous iterated function systems (IFSs) in \(\mathbb{R}\) with multiplicatively independent contraction factors have different attractors, to graph-directed IFSs in \(\mathbb{R}^n\) with contractions factors of the form \(\beta^{-1}\), \(\beta\in \mathbb N\). Employing this extension the authors not only proof a conjecture of Adamczewski and Bell but also establish a link to Büchi automata. This connection allows the characterization of subsets of \(\mathbb{R}^n\) whose representations in base \(\beta\in \mathbb{R}^+\) are recognized by Büchi automata in the case where \(\beta\) is a Pisot or Parry number.
    0 references
    iterated function system
    0 references
    graph-directed iterated function system
    0 references
    self-similar set
    0 references
    Cobham's theorem
    0 references
    \(\beta\)-numeration
    0 references
    Büchi automaton
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers