1 paper
Andrei Bulatov, Xiaoyang Gong, Bakh Khoussainov +1
We study constraint satisfaction problems (CSPs) where the constraint languages are defined by finite automata, giving rise to automata-based CSPs. The key notion is the concept of…