On finitely ambiguous Büchi automata
Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous B\"uchi a...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2018-09 |
|---|---|
| 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 | Löding, Christof Pirogov, Anton |
| description | Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous B\"uchi automata, a generalisation where each word has at most \(k\) accepting runs, for some fixed \(k\). We adapt existing notions and results concerning finite and bounded ambiguity of finite automata to the setting of \(\omega\)-languages and present a translation from arbitrary nondeterministic B\"uchi automata with \(n\) states to finitely ambiguous automata with at most \(3^n\) states and at most \(n\) accepting runs per word. |
| doi_str_mv | 10.48550/arxiv.1809.09415 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2112418526</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2112418526</sourcerecordid><originalsourceid>FETCH-proquest_journals_21124185263</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMztDCw1DOwNDE0ZWLgNDI2NtS1MDEy4mDgLS7OMjAwMDIzNzI1NeZkUPXPU0jLzMssSc2pVEjMTcpML80vLVZwOrwnOSNTIbG0JD83sSSRh4E1LTGnOJUXSnMzKLu5hjh76BYU5ReWphaXxGfllxblAaXijQwNjUwMLUyNzIyJUwUAgl014A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2112418526</pqid></control><display><type>article</type><title>On finitely ambiguous Büchi automata</title><source>Free E- Journals</source><creator>Löding, Christof ; Pirogov, Anton</creator><creatorcontrib>Löding, Christof ; Pirogov, Anton</creatorcontrib><description>Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous B\"uchi automata, a generalisation where each word has at most \(k\) accepting runs, for some fixed \(k\). We adapt existing notions and results concerning finite and bounded ambiguity of finite automata to the setting of \(\omega\)-languages and present a translation from arbitrary nondeterministic B\"uchi automata with \(n\) states to finitely ambiguous automata with at most \(3^n\) states and at most \(n\) accepting runs per word.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1809.09415</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Automata theory ; Probabilistic models</subject><ispartof>arXiv.org, 2018-09</ispartof><rights>2018. 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><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>780,784,27925</link.rule.ids></links><search><creatorcontrib>Löding, Christof</creatorcontrib><creatorcontrib>Pirogov, Anton</creatorcontrib><title>On finitely ambiguous Büchi automata</title><title>arXiv.org</title><description>Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous B\"uchi automata, a generalisation where each word has at most \(k\) accepting runs, for some fixed \(k\). We adapt existing notions and results concerning finite and bounded ambiguity of finite automata to the setting of \(\omega\)-languages and present a translation from arbitrary nondeterministic B\"uchi automata with \(n\) states to finitely ambiguous automata with at most \(3^n\) states and at most \(n\) accepting runs per word.</description><subject>Automata theory</subject><subject>Probabilistic models</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMztDCw1DOwNDE0ZWLgNDI2NtS1MDEy4mDgLS7OMjAwMDIzNzI1NeZkUPXPU0jLzMssSc2pVEjMTcpML80vLVZwOrwnOSNTIbG0JD83sSSRh4E1LTGnOJUXSnMzKLu5hjh76BYU5ReWphaXxGfllxblAaXijQwNjUwMLUyNzIyJUwUAgl014A</recordid><startdate>20180925</startdate><enddate>20180925</enddate><creator>Löding, Christof</creator><creator>Pirogov, Anton</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></search><sort><creationdate>20180925</creationdate><title>On finitely ambiguous Büchi automata</title><author>Löding, Christof ; Pirogov, Anton</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_21124185263</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Automata theory</topic><topic>Probabilistic models</topic><toplevel>online_resources</toplevel><creatorcontrib>Löding, Christof</creatorcontrib><creatorcontrib>Pirogov, Anton</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Löding, Christof</au><au>Pirogov, Anton</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>On finitely ambiguous Büchi automata</atitle><jtitle>arXiv.org</jtitle><date>2018-09-25</date><risdate>2018</risdate><eissn>2331-8422</eissn><abstract>Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous B\"uchi automata, a generalisation where each word has at most \(k\) accepting runs, for some fixed \(k\). We adapt existing notions and results concerning finite and bounded ambiguity of finite automata to the setting of \(\omega\)-languages and present a translation from arbitrary nondeterministic B\"uchi automata with \(n\) states to finitely ambiguous automata with at most \(3^n\) states and at most \(n\) accepting runs per word.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1809.09415</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2018-09 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2112418526 |
| source | Free E- Journals |
| subjects | Automata theory Probabilistic models |
| title | On finitely ambiguous Büchi automata |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T18%3A04%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=On%20finitely%20ambiguous%20B%C3%BCchi%20automata&rft.jtitle=arXiv.org&rft.au=L%C3%B6ding,%20Christof&rft.date=2018-09-25&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1809.09415&rft_dat=%3Cproquest%3E2112418526%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2112418526&rft_id=info:pmid/&rfr_iscdi=true |