Computational Parallels between the Regular and Context-Free Languages

Computational Parallels between the Regular and Context-Free Languages

Several sufficient conditions are presented for a regular set or context-free language problem to be as hard as testing for emptiness or testing for equivalence to the language $\{ 0,1\} ^ * $. These sufficient conditions provide a unified method for proving undecidability or complexity results and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing 1978-02, Vol.7 (1), p.99-114
Hauptverfasser: Hunt, III, H. B., Rosenkrantz, D. J.
Format: Artikel
Sprache:eng
Schlagworte:
Grammar
Language
R&D
Research & development
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 114
container_issue 1
container_start_page 99
container_title SIAM journal on computing
container_volume 7
creator Hunt, III, H. B.
Rosenkrantz, D. J.
description Several sufficient conditions are presented for a regular set or context-free language problem to be as hard as testing for emptiness or testing for equivalence to the language $\{ 0,1\} ^ * $. These sufficient conditions provide a unified method for proving undecidability or complexity results and apply to a large number of language problems studied in the literature. Many new nonpolynomial lower complexity bounds and undecidability results follow easily. The techniques used to prove these sufficient conditions involve reducibilities utilizing simple and efficient encodings by homomorphisms.
doi_str_mv 10.1137/0207007
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_918481038</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2572739631</sourcerecordid><originalsourceid>FETCH-LOGICAL-c182t-5d5e1326cb3e65c4dc68cac6a65380cd457798b480b819f9ef53348a0799d8463</originalsourceid><addsrcrecordid>eNotkFFLwzAURoMoOKf4F4IvPlXvbZImeZTipjBQRJ9Lmt7Wja6dSYr6751sT9_L4eNwGLtGuEMU-h5y0AD6hM0QrMo0Ip6yGYDVmRJWn7OLGDcAKCWKGVuU43Y3JZfW4-B6_uqC63vqI68pfRMNPH0Sf6Nu6l3gbmh4OQ6JflK2CER85YZuch3FS3bWuj7S1XHn7GPx-F4-ZauX5XP5sMo8mjxlqlGEIi98LahQXja-MN75whVKGPCNVFpbU0sDtUHbWmqVENI40NY2RhZizm4Ov7swfk0UU7UZp7A3j5VFIw2CMHvo9gD5MMYYqK12Yb114bdCqP4bVcdG4g_s8Fcp</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>918481038</pqid></control><display><type>article</type><title>Computational Parallels between the Regular and Context-Free Languages</title><source>SIAM Journals Online</source><creator>Hunt, III, H. B. ; Rosenkrantz, D. J.</creator><creatorcontrib>Hunt, III, H. B. ; Rosenkrantz, D. J.</creatorcontrib><description>Several sufficient conditions are presented for a regular set or context-free language problem to be as hard as testing for emptiness or testing for equivalence to the language $\{ 0,1\} ^ * $. These sufficient conditions provide a unified method for proving undecidability or complexity results and apply to a large number of language problems studied in the literature. Many new nonpolynomial lower complexity bounds and undecidability results follow easily. The techniques used to prove these sufficient conditions involve reducibilities utilizing simple and efficient encodings by homomorphisms.</description><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><identifier>DOI: 10.1137/0207007</identifier><language>eng</language><publisher>Philadelphia: Society for Industrial and Applied Mathematics</publisher><subject>Grammar ; Language ; R&amp;D ; Research &amp; development</subject><ispartof>SIAM journal on computing, 1978-02, Vol.7 (1), p.99-114</ispartof><rights>[Copyright] © 1978 Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c182t-5d5e1326cb3e65c4dc68cac6a65380cd457798b480b819f9ef53348a0799d8463</citedby><cites>FETCH-LOGICAL-c182t-5d5e1326cb3e65c4dc68cac6a65380cd457798b480b819f9ef53348a0799d8463</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,3184,27924,27925</link.rule.ids></links><search><creatorcontrib>Hunt, III, H. B.</creatorcontrib><creatorcontrib>Rosenkrantz, D. J.</creatorcontrib><title>Computational Parallels between the Regular and Context-Free Languages</title><title>SIAM journal on computing</title><description>Several sufficient conditions are presented for a regular set or context-free language problem to be as hard as testing for emptiness or testing for equivalence to the language $\{ 0,1\} ^ * $. These sufficient conditions provide a unified method for proving undecidability or complexity results and apply to a large number of language problems studied in the literature. Many new nonpolynomial lower complexity bounds and undecidability results follow easily. The techniques used to prove these sufficient conditions involve reducibilities utilizing simple and efficient encodings by homomorphisms.</description><subject>Grammar</subject><subject>Language</subject><subject>R&amp;D</subject><subject>Research &amp; development</subject><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1978</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>eNotkFFLwzAURoMoOKf4F4IvPlXvbZImeZTipjBQRJ9Lmt7Wja6dSYr6751sT9_L4eNwGLtGuEMU-h5y0AD6hM0QrMo0Ip6yGYDVmRJWn7OLGDcAKCWKGVuU43Y3JZfW4-B6_uqC63vqI68pfRMNPH0Sf6Nu6l3gbmh4OQ6JflK2CER85YZuch3FS3bWuj7S1XHn7GPx-F4-ZauX5XP5sMo8mjxlqlGEIi98LahQXja-MN75whVKGPCNVFpbU0sDtUHbWmqVENI40NY2RhZizm4Ov7swfk0UU7UZp7A3j5VFIw2CMHvo9gD5MMYYqK12Yb114bdCqP4bVcdG4g_s8Fcp</recordid><startdate>19780201</startdate><enddate>19780201</enddate><creator>Hunt, III, H. B.</creator><creator>Rosenkrantz, D. J.</creator><general>Society for Industrial and Applied Mathematics</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7RQ</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>S0W</scope><scope>U9A</scope></search><sort><creationdate>19780201</creationdate><title>Computational Parallels between the Regular and Context-Free Languages</title><author>Hunt, III, H. B. ; Rosenkrantz, D. J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c182t-5d5e1326cb3e65c4dc68cac6a65380cd457798b480b819f9ef53348a0799d8463</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1978</creationdate><topic>Grammar</topic><topic>Language</topic><topic>R&amp;D</topic><topic>Research &amp; development</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hunt, III, H. B.</creatorcontrib><creatorcontrib>Rosenkrantz, D. J.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Career &amp; Technical Education Database</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>DELNET Engineering &amp; Technology Collection</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hunt, III, H. B.</au><au>Rosenkrantz, D. J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computational Parallels between the Regular and Context-Free Languages</atitle><jtitle>SIAM journal on computing</jtitle><date>1978-02-01</date><risdate>1978</risdate><volume>7</volume><issue>1</issue><spage>99</spage><epage>114</epage><pages>99-114</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><abstract>Several sufficient conditions are presented for a regular set or context-free language problem to be as hard as testing for emptiness or testing for equivalence to the language $\{ 0,1\} ^ * $. These sufficient conditions provide a unified method for proving undecidability or complexity results and apply to a large number of language problems studied in the literature. Many new nonpolynomial lower complexity bounds and undecidability results follow easily. The techniques used to prove these sufficient conditions involve reducibilities utilizing simple and efficient encodings by homomorphisms.</abstract><cop>Philadelphia</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/0207007</doi><tpages>16</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0097-5397
ispartof SIAM journal on computing, 1978-02, Vol.7 (1), p.99-114
issn 0097-5397
1095-7111
language eng
recordid cdi_proquest_journals_918481038
source SIAM Journals Online
subjects Grammar
Language
R&D
Research & development
title Computational Parallels between the Regular and Context-Free Languages
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T20%3A59%3A11IST&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=Computational%20Parallels%20between%20the%20Regular%20and%20Context-Free%20Languages&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=Hunt,%20III,%20H.%20B.&rft.date=1978-02-01&rft.volume=7&rft.issue=1&rft.spage=99&rft.epage=114&rft.pages=99-114&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/10.1137/0207007&rft_dat=%3Cproquest_cross%3E2572739631%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=918481038&rft_id=info:pmid/&rfr_iscdi=true