2 papers
cs.FL2019
Monadic Decomposability of Regular Relations
Pablo Barcelo, Chih-Duo Hong, Xuan-Bach Le +2
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful…
cs.GT2016
Undecidability of Two-dimensional Robot Games
Reino Niskanen, Igor Potapov, Julien Reichert
Robot game is a two-player vector addition game played on the integer lattice . Both players have sets of vectors and in each turn the vector chosen by a player is ad…