On the Height of Towers of Subsequences and Prefixes
A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of words in the sequence. If there is no infinite tower (a tower of infinite height), then the height of all towers between the...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2017-05 |
|---|---|
| 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 | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Holub, Štěpán Masopust, Tomáš Thomazo, Michaël |
| description | A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of words in the sequence. If there is no infinite tower (a tower of infinite height), then the height of all towers between the languages is bounded. We study upper and lower bounds on the height of maximal finite towers with respect to the size of the NFA (the DFA) representation of the languages. We show that the upper bound is polynomial in the number of states and exponential in the size of the alphabet, and that it is asymptotically tight if the size of the alphabet is fixed. If the alphabet may grow, then, using an alphabet of size approximately the number of states of the automata, the lower bound on the height of towers is exponential with respect to that number. In this case, there is a gap between the lower and upper bound, and the asymptotically optimal bound remains an open problem. Since, in many cases, the constructed towers are sequences of prefixes, we also study towers of prefixes. |
| doi_str_mv | 10.48550/arxiv.1705.02813 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1705_02813</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2074218690</sourcerecordid><originalsourceid>FETCH-LOGICAL-a520-545dd3b91ff36f969224ab6824bcb511b85c1c2541923815516d2c7f3548e3723</originalsourceid><addsrcrecordid>eNotj1FLwzAUhYMgOOZ-gE8GfG7NvclN00cZ6oTBBPte0jZxHdrOpNX57-02n855OBy-j7EbEKkyROLehkP7nUImKBVoQF6wGUoJiVGIV2wR404IgTpDIjljatPxYev4yrXv24H3nhf9jwvx2N7GKrqv0XW1i9x2DX8NzrcHF6_Zpbcf0S3-c86Kp8diuUrWm-eX5cM6sYQiIUVNI6scvJfa5zpHVLbSBlVVVwRQGaqhRlKQozRABLrBOvOSlHEyQzlnt-fbk1K5D-2nDb_lUa08qU2Lu_NiH_oJNA7lrh9DNzGVKDKFYHQu5B9POU5l</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2074218690</pqid></control><display><type>article</type><title>On the Height of Towers of Subsequences and Prefixes</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Holub, Štěpán ; Masopust, Tomáš ; Thomazo, Michaël</creator><creatorcontrib>Holub, Štěpán ; Masopust, Tomáš ; Thomazo, Michaël</creatorcontrib><description>A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of words in the sequence. If there is no infinite tower (a tower of infinite height), then the height of all towers between the languages is bounded. We study upper and lower bounds on the height of maximal finite towers with respect to the size of the NFA (the DFA) representation of the languages. We show that the upper bound is polynomial in the number of states and exponential in the size of the alphabet, and that it is asymptotically tight if the size of the alphabet is fixed. If the alphabet may grow, then, using an alphabet of size approximately the number of states of the automata, the lower bound on the height of towers is exponential with respect to that number. In this case, there is a gap between the lower and upper bound, and the asymptotically optimal bound remains an open problem. Since, in many cases, the constructed towers are sequences of prefixes, we also study towers of prefixes.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1705.02813</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Asymptotic properties ; Computer Science - Formal Languages and Automata Theory ; Languages ; Lower bounds ; Polynomials ; Towers ; Upper bounds</subject><ispartof>arXiv.org, 2017-05</ispartof><rights>2017. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.1016/j.ic.2019.01.004$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1705.02813$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Holub, Štěpán</creatorcontrib><creatorcontrib>Masopust, Tomáš</creatorcontrib><creatorcontrib>Thomazo, Michaël</creatorcontrib><title>On the Height of Towers of Subsequences and Prefixes</title><title>arXiv.org</title><description>A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of words in the sequence. If there is no infinite tower (a tower of infinite height), then the height of all towers between the languages is bounded. We study upper and lower bounds on the height of maximal finite towers with respect to the size of the NFA (the DFA) representation of the languages. We show that the upper bound is polynomial in the number of states and exponential in the size of the alphabet, and that it is asymptotically tight if the size of the alphabet is fixed. If the alphabet may grow, then, using an alphabet of size approximately the number of states of the automata, the lower bound on the height of towers is exponential with respect to that number. In this case, there is a gap between the lower and upper bound, and the asymptotically optimal bound remains an open problem. Since, in many cases, the constructed towers are sequences of prefixes, we also study towers of prefixes.</description><subject>Asymptotic properties</subject><subject>Computer Science - Formal Languages and Automata Theory</subject><subject>Languages</subject><subject>Lower bounds</subject><subject>Polynomials</subject><subject>Towers</subject><subject>Upper bounds</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj1FLwzAUhYMgOOZ-gE8GfG7NvclN00cZ6oTBBPte0jZxHdrOpNX57-02n855OBy-j7EbEKkyROLehkP7nUImKBVoQF6wGUoJiVGIV2wR404IgTpDIjljatPxYev4yrXv24H3nhf9jwvx2N7GKrqv0XW1i9x2DX8NzrcHF6_Zpbcf0S3-c86Kp8diuUrWm-eX5cM6sYQiIUVNI6scvJfa5zpHVLbSBlVVVwRQGaqhRlKQozRABLrBOvOSlHEyQzlnt-fbk1K5D-2nDb_lUa08qU2Lu_NiH_oJNA7lrh9DNzGVKDKFYHQu5B9POU5l</recordid><startdate>20170508</startdate><enddate>20170508</enddate><creator>Holub, Štěpán</creator><creator>Masopust, Tomáš</creator><creator>Thomazo, Michaël</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20170508</creationdate><title>On the Height of Towers of Subsequences and Prefixes</title><author>Holub, Štěpán ; Masopust, Tomáš ; Thomazo, Michaël</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a520-545dd3b91ff36f969224ab6824bcb511b85c1c2541923815516d2c7f3548e3723</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Asymptotic properties</topic><topic>Computer Science - Formal Languages and Automata Theory</topic><topic>Languages</topic><topic>Lower bounds</topic><topic>Polynomials</topic><topic>Towers</topic><topic>Upper bounds</topic><toplevel>online_resources</toplevel><creatorcontrib>Holub, Štěpán</creatorcontrib><creatorcontrib>Masopust, Tomáš</creatorcontrib><creatorcontrib>Thomazo, Michaël</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Holub, Štěpán</au><au>Masopust, Tomáš</au><au>Thomazo, Michaël</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Height of Towers of Subsequences and Prefixes</atitle><jtitle>arXiv.org</jtitle><date>2017-05-08</date><risdate>2017</risdate><eissn>2331-8422</eissn><abstract>A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of words in the sequence. If there is no infinite tower (a tower of infinite height), then the height of all towers between the languages is bounded. We study upper and lower bounds on the height of maximal finite towers with respect to the size of the NFA (the DFA) representation of the languages. We show that the upper bound is polynomial in the number of states and exponential in the size of the alphabet, and that it is asymptotically tight if the size of the alphabet is fixed. If the alphabet may grow, then, using an alphabet of size approximately the number of states of the automata, the lower bound on the height of towers is exponential with respect to that number. In this case, there is a gap between the lower and upper bound, and the asymptotically optimal bound remains an open problem. Since, in many cases, the constructed towers are sequences of prefixes, we also study towers of prefixes.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1705.02813</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2017-05 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1705_02813 |
| source | arXiv.org; Free E- Journals |
| subjects | Asymptotic properties Computer Science - Formal Languages and Automata Theory Languages Lower bounds Polynomials Towers Upper bounds |
| title | On the Height of Towers of Subsequences and Prefixes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T08%3A44%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Height%20of%20Towers%20of%20Subsequences%20and%20Prefixes&rft.jtitle=arXiv.org&rft.au=Holub,%20%C5%A0t%C4%9Bp%C3%A1n&rft.date=2017-05-08&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1705.02813&rft_dat=%3Cproquest_arxiv%3E2074218690%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2074218690&rft_id=info:pmid/&rfr_iscdi=true |