A reducibility for the dot-depth hierarchy
Hierarchies considered in computability theory and in complexity theory are related to some reducibilities in the sense that levels of the hierarchies are downward closed and have complete sets. In this paper we propose a reducibility having similar relationship to the Brzozowski's dot-depth hi...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2005-11, Vol.345 (2), p.448-472 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 472 |
|---|---|
| container_issue | 2 |
| container_start_page | 448 |
| container_title | Theoretical computer science |
| container_volume | 345 |
| creator | Selivanov, Victor L. Wagner, Klaus W. |
| description | Hierarchies considered in computability theory and in complexity theory are related to some reducibilities in the sense that levels of the hierarchies are downward closed and have complete sets. In this paper we propose a reducibility having similar relationship to the Brzozowski's dot-depth hierarchy and some its refinements. We prove some basic facts on the corresponding degree structure and discuss relationships of the reducibility to complexity theory (via the leaf-language approach). |
| doi_str_mv | 10.1016/j.tcs.2005.07.020 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28058115</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397505004068</els_id><sourcerecordid>28058115</sourcerecordid><originalsourceid>FETCH-LOGICAL-c371t-5ecdfa9fee1dd70ee3f83670459cb0150bc6fec3597131bb9e2e08579ef9c3ca3</originalsourceid><addsrcrecordid>eNp9kE1LAzEURYMoWKs_wN2sXAgzvkyayQRXRfyCghtdh5mXFyZl2qlJKvTfm1LXvs3b3HPhHsZuOVQcePOwrhLGqgaQFagKajhjM94qXda1XpyzGQhYlEIrecmuYlxDPqmaGbtfFoHsHn3vR58OhZtCkQYq7JRKS7s0FIOn0AUcDtfswnVjpJu_P2dfL8-fT2_l6uP1_Wm5KlEonkpJaF2nHRG3VgGRcK1oFCykxh64hB4bRyikVlzwvtdUE7RSaXIaBXZizu5Ovbswfe8pJrPxEWkcuy1N-2jqFmTLucxBfgpimGIM5Mwu-E0XDoaDOVoxa5OtmKMVA8pkK5l5PDGUF_zkaSaipy2S9YEwGTv5f-hf3PVqLQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28058115</pqid></control><display><type>article</type><title>A reducibility for the dot-depth hierarchy</title><source>Access via ScienceDirect (Elsevier)</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Selivanov, Victor L. ; Wagner, Klaus W.</creator><creatorcontrib>Selivanov, Victor L. ; Wagner, Klaus W.</creatorcontrib><description>Hierarchies considered in computability theory and in complexity theory are related to some reducibilities in the sense that levels of the hierarchies are downward closed and have complete sets. In this paper we propose a reducibility having similar relationship to the Brzozowski's dot-depth hierarchy and some its refinements. We prove some basic facts on the corresponding degree structure and discuss relationships of the reducibility to complexity theory (via the leaf-language approach).</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/j.tcs.2005.07.020</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Complete sets ; Degree structure ; Dot-depth hierarchy ; Leaf languages ; Reducibility</subject><ispartof>Theoretical computer science, 2005-11, Vol.345 (2), p.448-472</ispartof><rights>2005 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c371t-5ecdfa9fee1dd70ee3f83670459cb0150bc6fec3597131bb9e2e08579ef9c3ca3</citedby><cites>FETCH-LOGICAL-c371t-5ecdfa9fee1dd70ee3f83670459cb0150bc6fec3597131bb9e2e08579ef9c3ca3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.tcs.2005.07.020$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>315,782,786,3554,27933,27934,46004</link.rule.ids></links><search><creatorcontrib>Selivanov, Victor L.</creatorcontrib><creatorcontrib>Wagner, Klaus W.</creatorcontrib><title>A reducibility for the dot-depth hierarchy</title><title>Theoretical computer science</title><description>Hierarchies considered in computability theory and in complexity theory are related to some reducibilities in the sense that levels of the hierarchies are downward closed and have complete sets. In this paper we propose a reducibility having similar relationship to the Brzozowski's dot-depth hierarchy and some its refinements. We prove some basic facts on the corresponding degree structure and discuss relationships of the reducibility to complexity theory (via the leaf-language approach).</description><subject>Complete sets</subject><subject>Degree structure</subject><subject>Dot-depth hierarchy</subject><subject>Leaf languages</subject><subject>Reducibility</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEURYMoWKs_wN2sXAgzvkyayQRXRfyCghtdh5mXFyZl2qlJKvTfm1LXvs3b3HPhHsZuOVQcePOwrhLGqgaQFagKajhjM94qXda1XpyzGQhYlEIrecmuYlxDPqmaGbtfFoHsHn3vR58OhZtCkQYq7JRKS7s0FIOn0AUcDtfswnVjpJu_P2dfL8-fT2_l6uP1_Wm5KlEonkpJaF2nHRG3VgGRcK1oFCykxh64hB4bRyikVlzwvtdUE7RSaXIaBXZizu5Ovbswfe8pJrPxEWkcuy1N-2jqFmTLucxBfgpimGIM5Mwu-E0XDoaDOVoxa5OtmKMVA8pkK5l5PDGUF_zkaSaipy2S9YEwGTv5f-hf3PVqLQ</recordid><startdate>20051122</startdate><enddate>20051122</enddate><creator>Selivanov, Victor L.</creator><creator>Wagner, Klaus W.</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20051122</creationdate><title>A reducibility for the dot-depth hierarchy</title><author>Selivanov, Victor L. ; Wagner, Klaus W.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c371t-5ecdfa9fee1dd70ee3f83670459cb0150bc6fec3597131bb9e2e08579ef9c3ca3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Complete sets</topic><topic>Degree structure</topic><topic>Dot-depth hierarchy</topic><topic>Leaf languages</topic><topic>Reducibility</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Selivanov, Victor L.</creatorcontrib><creatorcontrib>Wagner, Klaus W.</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</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>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Selivanov, Victor L.</au><au>Wagner, Klaus W.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A reducibility for the dot-depth hierarchy</atitle><jtitle>Theoretical computer science</jtitle><date>2005-11-22</date><risdate>2005</risdate><volume>345</volume><issue>2</issue><spage>448</spage><epage>472</epage><pages>448-472</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><abstract>Hierarchies considered in computability theory and in complexity theory are related to some reducibilities in the sense that levels of the hierarchies are downward closed and have complete sets. In this paper we propose a reducibility having similar relationship to the Brzozowski's dot-depth hierarchy and some its refinements. We prove some basic facts on the corresponding degree structure and discuss relationships of the reducibility to complexity theory (via the leaf-language approach).</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.tcs.2005.07.020</doi><tpages>25</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2005-11, Vol.345 (2), p.448-472 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28058115 |
| source | Access via ScienceDirect (Elsevier); EZB-FREE-00999 freely available EZB journals |
| subjects | Complete sets Degree structure Dot-depth hierarchy Leaf languages Reducibility |
| title | A reducibility for the dot-depth hierarchy |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-03T09%3A08%3A53IST&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=A%20reducibility%20for%20the%20dot-depth%20hierarchy&rft.jtitle=Theoretical%20computer%20science&rft.au=Selivanov,%20Victor%20L.&rft.date=2005-11-22&rft.volume=345&rft.issue=2&rft.spage=448&rft.epage=472&rft.pages=448-472&rft.issn=0304-3975&rft.eissn=1879-2294&rft_id=info:doi/10.1016/j.tcs.2005.07.020&rft_dat=%3Cproquest_cross%3E28058115%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=28058115&rft_id=info:pmid/&rft_els_id=S0304397505004068&rfr_iscdi=true |