Caterpillar dualities and regular languages
Combinatorics
2013-07-23 v1 Discrete Mathematics
Abstract
We characterize obstruction sets in caterpillar dualities in terms of regular languages, and give a construction of the dual of a regular family of caterpillars. We show that these duals correspond to the constraint satisfaction problems definable by a monadic linear Datalog program with at most one EDB per rule.
Cite
@article{arxiv.1203.1347,
title = {Caterpillar dualities and regular languages},
author = {Péter L. Erdős and Claude Tardif and Gábor Tardos},
journal= {arXiv preprint arXiv:1203.1347},
year = {2013}
}