Caterpillar dualities and regular languages

Details Caterpillar dualities and regular languages Caterpillar dualities and regular languages

2012-03-06

arxiv.org/abs/1203.1347v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Caterpillar dualities and regular languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Caterpillar dualities and regular languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Caterpillar dualities and regular languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392697