28 citations to 10.1016/S0304-3975(02)00847-2 (Crossref Cited-By Service)
  1. Krzysztof Leśniak, Nina Snigireva, Filip Strobin, “Rate of convergence in the disjunctive chaos game algorithm”, Chaos: An Interdisciplinary Journal of Nonlinear Science, 32, № 1, 2022, 013110  crossref
  2. Toghrul Karimov, Edon Kelmendi, Joris Nieuwveld, Joël Ouaknine, James Worrell, 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2023, 1  crossref
  3. Юрий Львович Притыкин, Yurii L'vovich Pritykin, “Конечно-автоматные преобразования строго почти периодических последовательностей”, Матем. заметки, 80, № 5, 2006, 751  crossref
  4. Mikołaj Bojańczyk, Edon Kelmendi, Rafał Stefański, Georg Zetzsche, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, 266  crossref
  5. Petr Hasil, Michal Veselý, “Almost periodic transformable difference systems”, Applied Mathematics and Computation, 218, № 9, 2012, 5562  crossref
  6. A. Yu. Rumyantsev, M. A. Ushakov, 3884, STACS 2006, 2006, 396  crossref
  7. Jānis Buls, Edmunds Cers, “Modularity in the Semilattice of ω-Words”, Journal of Discrete Mathematics, 2014, 2014, 1  crossref
  8. Chengying Niu, Xiaoxing Chen, “Almost periodic sequence solutions of a discrete Lotka–Volterra competitive system with feedback control”, Nonlinear Analysis: Real World Applications, 10, № 5, 2009, 3152  crossref
  9. Krzysztof Leśniak, Nina Snigireva, Filip Strobin, “Weakly contractive iterated function systems and beyond: a manual”, Journal of Difference Equations and Applications, 26, № 8, 2020, 1114  crossref
  10. Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Anton Varonka, Markus A. Whiteland, James Worrell, “What’s decidable about linear loops?”, Proc. ACM Program. Lang., 6, № POPL, 2022, 1  crossref
1
2
3
Следующая