5 citations · 9 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.DS2021★ 1 cited
Generically Nilpotent Cellular Automata
Ilkka Törmä
We study the generic limit sets of one-dimensional cellular automata, which intuitively capture their asymptotic dynamics while discarding transient phenomena. As our main results,…
cs.FL2021
Winning Sets of Regular Languages: Descriptional and Computational Complexity
Pierre Marcus, Ilkka Törmä
We investigate certain word-construction games with variable turn orders. In these games, Alice and Bob take turns on choosing consecutive letters of a word of fixed length, with A…