5 citations · 9 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.FL2020
Descriptional Complexity of Winning Sets of Regular Languages
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…
math.DS2020
A Physically Universal Turing Machine
Ville Salo, Ilkka Törmä
We construct a two-dimensional Turing machine that is physically universal in both the moving tape and moving head model. In particular, it is mixing of all finite orders in both m…