A note on emptiness for alternating finite automata with a one-letter alphabet
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a proof relying on a series of reductions from several papers. The new proof is simple, direct and self-contained.
Gespeichert in:
| Veröffentlicht in: | Information processing letters 2007-11, Vol.104 (5), p.164-167 |
|---|---|
| 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 | 167 |
|---|---|
| container_issue | 5 |
| container_start_page | 164 |
| container_title | Information processing letters |
| container_volume | 104 |
| creator | Jančar, Petr Sawa, Zdeněk |
| description | We present a new proof of
PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a proof relying on a series of reductions from several papers. The new proof is simple, direct and self-contained. |
| doi_str_mv | 10.1016/j.ipl.2007.06.006 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237286937</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019007001597</els_id><sourcerecordid>1333322421</sourcerecordid><originalsourceid>FETCH-LOGICAL-c397t-d2fefe6747d6e87749ab6813d6bd2907cc878c10d1d421e93096ce51900ce8ca3</originalsourceid><addsrcrecordid>eNp9kM1LAzEQxYMoWD_-AG9B8LjrJLtNNngqxS8oetFzSJNZm7LdXZNU8b83pQVvngaG33vz5hFyxaBkwMTtuvRjV3IAWYIoAcQRmbBG8kIwpo7JBIBDAUzBKTmLcQ2ZqCs5IS8z2g8J6dBT3IzJ9xgjbYdATZcw9CZvPmjre58Zs03DxiRDv31aUZM1WHSYMpfpcWWWmC7ISWu6iJeHeU7eH-7f5k_F4vXxeT5bFLZSMhWOt9iikLV0Ahspa2WWomGVE0vHFUhrG9lYBo65mjNUFShhcZrjg8XGmuqcXO99xzB8bjEmvR62OW4XNa8kb4SqZIbYHrJhiDFgq8fgNyb8aAZ615pe69ya3rWmQejcSdbcHIxNtKZrg-mtj39CBdOaqWnm7vYc5i-_PAYdrcfeovMBbdJu8P9c-QXec4Gw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237286937</pqid></control><display><type>article</type><title>A note on emptiness for alternating finite automata with a one-letter alphabet</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Jančar, Petr ; Sawa, Zdeněk</creator><creatorcontrib>Jančar, Petr ; Sawa, Zdeněk</creatorcontrib><description>We present a new proof of
PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a proof relying on a series of reductions from several papers. The new proof is simple, direct and self-contained.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/j.ipl.2007.06.006</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Alternating finite automaton ; Applied sciences ; Computational complexity ; Computer science; control theory; systems ; Emptiness ; Exact sciences and technology ; Information processing ; Language theory and syntactical analysis ; Miscellaneous ; Studies ; Theoretical computing ; Vector space</subject><ispartof>Information processing letters, 2007-11, Vol.104 (5), p.164-167</ispartof><rights>2007 Elsevier B.V.</rights><rights>2008 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Nov 30, 2007</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c397t-d2fefe6747d6e87749ab6813d6bd2907cc878c10d1d421e93096ce51900ce8ca3</citedby><cites>FETCH-LOGICAL-c397t-d2fefe6747d6e87749ab6813d6bd2907cc878c10d1d421e93096ce51900ce8ca3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ipl.2007.06.006$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19054195$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Jančar, Petr</creatorcontrib><creatorcontrib>Sawa, Zdeněk</creatorcontrib><title>A note on emptiness for alternating finite automata with a one-letter alphabet</title><title>Information processing letters</title><description>We present a new proof of
PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a proof relying on a series of reductions from several papers. The new proof is simple, direct and self-contained.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Alternating finite automaton</subject><subject>Applied sciences</subject><subject>Computational complexity</subject><subject>Computer science; control theory; systems</subject><subject>Emptiness</subject><subject>Exact sciences and technology</subject><subject>Information processing</subject><subject>Language theory and syntactical analysis</subject><subject>Miscellaneous</subject><subject>Studies</subject><subject>Theoretical computing</subject><subject>Vector space</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNp9kM1LAzEQxYMoWD_-AG9B8LjrJLtNNngqxS8oetFzSJNZm7LdXZNU8b83pQVvngaG33vz5hFyxaBkwMTtuvRjV3IAWYIoAcQRmbBG8kIwpo7JBIBDAUzBKTmLcQ2ZqCs5IS8z2g8J6dBT3IzJ9xgjbYdATZcw9CZvPmjre58Zs03DxiRDv31aUZM1WHSYMpfpcWWWmC7ISWu6iJeHeU7eH-7f5k_F4vXxeT5bFLZSMhWOt9iikLV0Ahspa2WWomGVE0vHFUhrG9lYBo65mjNUFShhcZrjg8XGmuqcXO99xzB8bjEmvR62OW4XNa8kb4SqZIbYHrJhiDFgq8fgNyb8aAZ615pe69ya3rWmQejcSdbcHIxNtKZrg-mtj39CBdOaqWnm7vYc5i-_PAYdrcfeovMBbdJu8P9c-QXec4Gw</recordid><startdate>20071130</startdate><enddate>20071130</enddate><creator>Jančar, Petr</creator><creator>Sawa, Zdeněk</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</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>20071130</creationdate><title>A note on emptiness for alternating finite automata with a one-letter alphabet</title><author>Jančar, Petr ; Sawa, Zdeněk</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c397t-d2fefe6747d6e87749ab6813d6bd2907cc878c10d1d421e93096ce51900ce8ca3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Alternating finite automaton</topic><topic>Applied sciences</topic><topic>Computational complexity</topic><topic>Computer science; control theory; systems</topic><topic>Emptiness</topic><topic>Exact sciences and technology</topic><topic>Information processing</topic><topic>Language theory and syntactical analysis</topic><topic>Miscellaneous</topic><topic>Studies</topic><topic>Theoretical computing</topic><topic>Vector space</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jančar, Petr</creatorcontrib><creatorcontrib>Sawa, Zdeněk</creatorcontrib><collection>Pascal-Francis</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>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jančar, Petr</au><au>Sawa, Zdeněk</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A note on emptiness for alternating finite automata with a one-letter alphabet</atitle><jtitle>Information processing letters</jtitle><date>2007-11-30</date><risdate>2007</risdate><volume>104</volume><issue>5</issue><spage>164</spage><epage>167</epage><pages>164-167</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>We present a new proof of
PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a proof relying on a series of reductions from several papers. The new proof is simple, direct and self-contained.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ipl.2007.06.006</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 2007-11, Vol.104 (5), p.164-167 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237286937 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Algorithmics. Computability. Computer arithmetics Alternating finite automaton Applied sciences Computational complexity Computer science control theory systems Emptiness Exact sciences and technology Information processing Language theory and syntactical analysis Miscellaneous Studies Theoretical computing Vector space |
| title | A note on emptiness for alternating finite automata with a one-letter alphabet |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T00%3A29%3A21IST&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%20note%20on%20emptiness%20for%20alternating%20finite%20automata%20with%20a%20one-letter%20alphabet&rft.jtitle=Information%20processing%20letters&rft.au=Jan%C4%8Dar,%20Petr&rft.date=2007-11-30&rft.volume=104&rft.issue=5&rft.spage=164&rft.epage=167&rft.pages=164-167&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/j.ipl.2007.06.006&rft_dat=%3Cproquest_cross%3E1333322421%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=237286937&rft_id=info:pmid/&rft_els_id=S0020019007001597&rfr_iscdi=true |