Caterpillar Dualities and Regular Languages

Caterpillar Dualities and Regular Languages

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. In particular, we prove that every monadic linear Datalog program with at most one extensional database per rule defines the complement of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on discrete mathematics 2013-01, Vol.27 (3), p.1287-1294
Hauptverfasser: Erdos, Peter L, Tardif, Claude, Tardos, Gabor
Format: Artikel
Sprache:eng
Schlagworte:
Applied mathematics
Caterpillars
Complement
Construction
Language
Mathematical analysis
Obstructions
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. In particular, we prove that every monadic linear Datalog program with at most one extensional database per rule defines the complement of a contraint satisfaction problem. [PUBLICATION ABSTRACT]
ISSN:0895-4801
1095-7146
DOI:10.1137/120879270