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!
container_end_page 1294
container_issue 3
container_start_page 1287
container_title SIAM journal on discrete mathematics
container_volume 27
creator Erdos, Peter L
Tardif, Claude
Tardos, Gabor
description 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]
doi_str_mv 10.1137/120879270
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1429878192</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3022333191</sourcerecordid><originalsourceid>FETCH-LOGICAL-c250t-12a7e83ffee480bb4d72137c9d5ff6bdbcc0042d844b40547e2b12764524dd503</originalsourceid><addsrcrecordid>eNpdkE1Lw0AQhhdRsEYP_oOCF0WiM5vZ7OYorV9QEETPYZOdlJQ0qbvJwX_vlooHTzMMD--8PEJcItwhZvoeJRhdSA1HYoZQqFQj5cdiBibuZABPxVkIGwAkQjUTtws7st-1XWf9fDnZrh1bDnPbu_k7r6f9dWX79WTXHM7FSWO7wBe_MxGfT48fi5d09fb8unhYpbVUMKYorWaTNQ1zfFhV5LSM1erCqabJK1fVNQBJZ4gqAkWaZYVS56QkOacgS8T1IXfnh6-Jw1hu21BzrNjzMIUSSRZGGyxkRK_-oZth8n1sFymAvMgoaknEzYGq_RCC56bc-XZr_XeJUO61lX_ash-Z8lw6</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1400693411</pqid></control><display><type>article</type><title>Caterpillar Dualities and Regular Languages</title><source>LOCUS - SIAM's Online Journal Archive</source><creator>Erdos, Peter L ; Tardif, Claude ; Tardos, Gabor</creator><creatorcontrib>Erdos, Peter L ; Tardif, Claude ; Tardos, Gabor</creatorcontrib><description>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]</description><identifier>ISSN: 0895-4801</identifier><identifier>EISSN: 1095-7146</identifier><identifier>DOI: 10.1137/120879270</identifier><language>eng</language><publisher>Philadelphia: Society for Industrial and Applied Mathematics</publisher><subject>Applied mathematics ; Caterpillars ; Complement ; Construction ; Language ; Mathematical analysis ; Obstructions</subject><ispartof>SIAM journal on discrete mathematics, 2013-01, Vol.27 (3), p.1287-1294</ispartof><rights>2013, Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c250t-12a7e83ffee480bb4d72137c9d5ff6bdbcc0042d844b40547e2b12764524dd503</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,3185,27924,27925</link.rule.ids></links><search><creatorcontrib>Erdos, Peter L</creatorcontrib><creatorcontrib>Tardif, Claude</creatorcontrib><creatorcontrib>Tardos, Gabor</creatorcontrib><title>Caterpillar Dualities and Regular Languages</title><title>SIAM journal on discrete mathematics</title><description>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]</description><subject>Applied mathematics</subject><subject>Caterpillars</subject><subject>Complement</subject><subject>Construction</subject><subject>Language</subject><subject>Mathematical analysis</subject><subject>Obstructions</subject><issn>0895-4801</issn><issn>1095-7146</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNpdkE1Lw0AQhhdRsEYP_oOCF0WiM5vZ7OYorV9QEETPYZOdlJQ0qbvJwX_vlooHTzMMD--8PEJcItwhZvoeJRhdSA1HYoZQqFQj5cdiBibuZABPxVkIGwAkQjUTtws7st-1XWf9fDnZrh1bDnPbu_k7r6f9dWX79WTXHM7FSWO7wBe_MxGfT48fi5d09fb8unhYpbVUMKYorWaTNQ1zfFhV5LSM1erCqabJK1fVNQBJZ4gqAkWaZYVS56QkOacgS8T1IXfnh6-Jw1hu21BzrNjzMIUSSRZGGyxkRK_-oZth8n1sFymAvMgoaknEzYGq_RCC56bc-XZr_XeJUO61lX_ash-Z8lw6</recordid><startdate>20130101</startdate><enddate>20130101</enddate><creator>Erdos, Peter L</creator><creator>Tardif, Claude</creator><creator>Tardos, Gabor</creator><general>Society for Industrial and Applied Mathematics</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X2</scope><scope>7XB</scope><scope>87Z</scope><scope>88A</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KB.</scope><scope>L.-</scope><scope>L6V</scope><scope>LK8</scope><scope>M0C</scope><scope>M0K</scope><scope>M0N</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>Q9U</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>H8D</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130101</creationdate><title>Caterpillar Dualities and Regular Languages</title><author>Erdos, Peter L ; Tardif, Claude ; Tardos, Gabor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c250t-12a7e83ffee480bb4d72137c9d5ff6bdbcc0042d844b40547e2b12764524dd503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Applied mathematics</topic><topic>Caterpillars</topic><topic>Complement</topic><topic>Construction</topic><topic>Language</topic><topic>Mathematical analysis</topic><topic>Obstructions</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Erdos, Peter L</creatorcontrib><creatorcontrib>Tardif, Claude</creatorcontrib><creatorcontrib>Tardos, Gabor</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Agricultural Science Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Biology Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Materials Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>ABI/INFORM Global</collection><collection>Agricultural Science Database</collection><collection>Computing Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>SIAM journal on discrete mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Erdos, Peter L</au><au>Tardif, Claude</au><au>Tardos, Gabor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Caterpillar Dualities and Regular Languages</atitle><jtitle>SIAM journal on discrete mathematics</jtitle><date>2013-01-01</date><risdate>2013</risdate><volume>27</volume><issue>3</issue><spage>1287</spage><epage>1294</epage><pages>1287-1294</pages><issn>0895-4801</issn><eissn>1095-7146</eissn><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. 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]</abstract><cop>Philadelphia</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/120879270</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0895-4801
ispartof SIAM journal on discrete mathematics, 2013-01, Vol.27 (3), p.1287-1294
issn 0895-4801
1095-7146
language eng
recordid cdi_proquest_miscellaneous_1429878192
source LOCUS - SIAM's Online Journal Archive
subjects Applied mathematics
Caterpillars
Complement
Construction
Language
Mathematical analysis
Obstructions
title Caterpillar Dualities and Regular Languages
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T18%3A04%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Caterpillar%20Dualities%20and%20Regular%20Languages&rft.jtitle=SIAM%20journal%20on%20discrete%20mathematics&rft.au=Erdos,%20Peter%20L&rft.date=2013-01-01&rft.volume=27&rft.issue=3&rft.spage=1287&rft.epage=1294&rft.pages=1287-1294&rft.issn=0895-4801&rft.eissn=1095-7146&rft_id=info:doi/10.1137/120879270&rft_dat=%3Cproquest_cross%3E3022333191%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1400693411&rft_id=info:pmid/&rfr_iscdi=true