23 citations · 100 across the 28 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.DS2014
Trace Complexity of Chaotic Reversible Cellular Automata
Jarkko Kari, Ville Salo, Ilkka Törmä
Delvenne, Kůrka and Blondel have defined new notions of computational complexity for arbitrary symbolic systems, and shown examples of effective systems that are computationally un…
cs.FL2014★ 2 cited
Undecidable properties of self-affine sets and multi-tape automata
Timo Jolivet, Jarkko Kari
We study the decidability of the topological properties of some objects coming from fractal geometry. We prove that having empty interior is undecidable for the sets defined by two…