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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q918007
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Peter R. Massopust / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963640634 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.0309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of Cobham’s theorem for fractals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pisot substitutions and Rauzy fractals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated function systems and the global construction of fractals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability by finite automata and pisot bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to write integers in a non-integral basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Cobham's theorem to automata over real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective decision procedure for linear arithmetic over the integers and reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Semenov’s Theorem to Automata over Real Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and \(p\)-recognizable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-dimensional analogue of Cobham’s theorem for fractals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the base-dependence of sets of numbers recognizable by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust and Practical Analog-to-Digital Conversion With Exponential Precision / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Golden Ratio Encoder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cobham's theorem for substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-similar and self-affine sets: measure of the intersection of two copies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structures of generating iterated function systems of Cantor sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for the First Order Theory of Real Addition with Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of numbers and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number representation and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient minimization of deterministic weak \(\omega\)-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On theβ-expansions of real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Répartition (mod 1) des puissances successives des nombres réels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombres algébriques et substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-affine tiling via substitution dynamical systems and Rauzy fractals. / rank
 
Normal rank

Revision as of 03:17, 10 July 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