36 citations · 111 across the 22 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.LO2026
Almost free algebras: from the word problem to elimination of quantifiers
Yifan Jia, Heer Tern Koh, Bakh Khoussainov
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term eq…
cs.LO2026
Automatic constraint satisfaction problem
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…