42 citations · 43 across the 2 of their papers we have counts for
2 papers
cs.CC2009★ 1 cited
The complexity of the list homomorphism problem for graphs
Laszlo Egri, Andrei Krokhin, Benoit Larose +1
We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the pro…
cs.LO2007★ 42 cited
Logic Meets Algebra: the Case of Regular Languages
Pascal Tesson, Denis Therien
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to…