23 citations · 100 across the 28 of their papers we have counts for
1 paper · 2 filters
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…