Caterpillar dualities and regular languages
classification
🧮 math.CO
cs.DM
keywords
regularcaterpillardualitieslanguagescaterpillarscharacterizeconstraintconstruction
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.