In this paper, we prove the rationality of the gluing relation of edge replacement systems, which were introduced for studying rearrangement groups of fractals. More precisely, we describe an algorithmic procedure for building a finite state automaton that recognizes pairs of equivalent sequences that are glued in the fractal. This fits in recent interest toward the rationality of gluing relations on totally disconnected compact metrizable spaces.
Perego, D., Tarocchi, M. (2025). Rational gluing in edge replacement systems. INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 35(1), 81-96 [10.1142/S0218196724500577].
Rational gluing in edge replacement systems
Perego D.;Tarocchi M.
2025
Abstract
In this paper, we prove the rationality of the gluing relation of edge replacement systems, which were introduced for studying rearrangement groups of fractals. More precisely, we describe an algorithmic procedure for building a finite state automaton that recognizes pairs of equivalent sequences that are glued in the fractal. This fits in recent interest toward the rationality of gluing relations on totally disconnected compact metrizable spaces.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Perego-2025-Int J Algebra Computation-VoR.pdf
Solo gestori archivio
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Tutti i diritti riservati
Dimensione
570.87 kB
Formato
Adobe PDF
|
570.87 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
