Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Tijdeman, R.
and
Zamboni, L.
2003.
Fine and Wilf words for any periods.
Indagationes Mathematicae,
Vol. 14,
Issue. 1,
p.
135.
Tijdeman, R.
and
Zamboni, L.Q.
2009.
Fine and Wilf words for any periods II.
Theoretical Computer Science,
Vol. 410,
Issue. 30-32,
p.
3027.
Fokkink, R.
Kraaikamp, C.
and
Nakada, H.
2011.
On Schweiger’s problems on fully subtractive algorithms.
Israel Journal of Mathematics,
Vol. 186,
Issue. 1,
p.
285.
Miernowski, Tomasz
and
Nogueira, Arnaldo
2012.
Absorbing sets of homogeneous subtractive algorithms.
Monatshefte für Mathematik,
Vol. 167,
Issue. 3-4,
p.
547.
Arnoux, Pierre
and
Starosta, Štěpán
2013.
Further Developments in Fractals and Related Fields.
p.
1.
Bruin, Henk
2014.
Ergodic Theory, Open Dynamics, and Coherent Structures.
Vol. 70,
Issue. ,
p.
105.
Domenjoud, Eric
Provençal, Xavier
and
Vuillon, Laurent
2014.
Advanced Information Systems Engineering.
Vol. 7908,
Issue. ,
p.
1.
Bruin, Henk
Fokkink, Robbert
and
Kraaikamp, Cor
2015.
The convergence of the generalised Selmer algorithm.
Israel Journal of Mathematics,
Vol. 209,
Issue. 2,
p.
803.
Domenjoud, Eric
Provençal, Xavier
and
Vuillon, Laurent
2016.
Palindromic language of thin discrete planes.
Theoretical Computer Science,
Vol. 624,
Issue. ,
p.
101.
Avila, Artur
and
Delecroix, Vincent
2019.
New Trends in One-Dimensional Dynamics.
Vol. 285,
Issue. ,
p.
21.
Domenjoud, Eric
Laboureix, Bastien
and
Vuillon, Laurent
2019.
Discrete Geometry for Computer Imagery.
Vol. 11414,
Issue. ,
p.
38.
Laboureix, Bastien
and
Domenjoud, Eric
2024.
On the connectedness of arithmetic hyperplanes.
Theoretical Computer Science,
Vol. 1017,
Issue. ,
p.
114797.