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

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!