Which finite monoids are syntactic monoids of rational ω-languages
A notion of ω-rigid sets for a finite monoid is introduced. We prove that a finite monoid M is the Arnold's syntactic monoid of some rational ω-language (ω-syntactic for short) if and only if there exists an ω-rigid set for M. This property is shown to be decidable for the finite monoids. Relat...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 1992-05, Vol.42 (3), p.127-132 |
|---|---|
| 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 | 132 |
|---|---|
| container_issue | 3 |
| container_start_page | 127 |
| container_title | Information processing letters |
| container_volume | 42 |
| creator | Huy, Phan Trung Livotsky, Igor Van, Do Long |
| description | A notion of ω-rigid sets for a finite monoid is introduced. We prove that a finite monoid
M is the Arnold's syntactic monoid of some rational ω-language (ω-syntactic for short) if and only if there exists an ω-rigid set for
M. This property is shown to be decidable for the finite monoids. Relationship between the family of ω-syntactic monoids and that of ∗-syntactic monoids (i.e. the syntactic monoids of rational languages of finite words) is established. |
| doi_str_mv | 10.1016/0020-0190(92)90135-I |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_25935153</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>002001909290135I</els_id><sourcerecordid>25935153</sourcerecordid><originalsourceid>FETCH-LOGICAL-c315t-fbd27f7651441d7427ff0bd8a5f48706644dd42af306c485761d85c2551313073</originalsourceid><addsrcrecordid>eNp9kMtKA0EQRRtRMEb_wMUsRHQx2tXPmY0gwUcg4EZx2XT6kbRMpmP3RMgn-HX-khMTsnRVVHHvraqD0DngG8AgbjEmuMRQ46uaXNcYKC_HB2gAlSSlAKgP0WAvOUYnOX9gjAWjcoBG7_Ng5oUPbehcsYhtDDYXOrkir9tOmy6Y_TT6IukuxFY3xc932eh2ttIzl0_RkddNdme7OkRvjw-vo-dy8vI0Ht1PSkOBd6WfWiK9FBwYAytZ33g8tZXmnlUSC8GYtYxoT7EwrOJSgK24IZwDBYolHaLLbe4yxc-Vy51ahGxc0x_i4iorwmvKgdNeyLZCk2LOyXm1TGGh01oBVhtiaoNDbXComqg_Ymrc2y52-Tob3fikWxPy3ssZhZps0u-2Mtf_-hVcUtkE1xpnQ3KmUzaG__f8Aj-kfhw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25935153</pqid></control><display><type>article</type><title>Which finite monoids are syntactic monoids of rational ω-languages</title><source>Elsevier ScienceDirect Journals</source><creator>Huy, Phan Trung ; Livotsky, Igor ; Van, Do Long</creator><creatorcontrib>Huy, Phan Trung ; Livotsky, Igor ; Van, Do Long</creatorcontrib><description>A notion of ω-rigid sets for a finite monoid is introduced. We prove that a finite monoid
M is the Arnold's syntactic monoid of some rational ω-language (ω-syntactic for short) if and only if there exists an ω-rigid set for
M. This property is shown to be decidable for the finite monoids. Relationship between the family of ω-syntactic monoids and that of ∗-syntactic monoids (i.e. the syntactic monoids of rational languages of finite words) is established.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/0020-0190(92)90135-I</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Formal languages ; Language theory and syntactical analysis ; syntactic monoid ; Theoretical computing ; ω-languages</subject><ispartof>Information processing letters, 1992-05, Vol.42 (3), p.127-132</ispartof><rights>1992</rights><rights>1992 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c315t-fbd27f7651441d7427ff0bd8a5f48706644dd42af306c485761d85c2551313073</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/002001909290135I$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5431923$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Huy, Phan Trung</creatorcontrib><creatorcontrib>Livotsky, Igor</creatorcontrib><creatorcontrib>Van, Do Long</creatorcontrib><title>Which finite monoids are syntactic monoids of rational ω-languages</title><title>Information processing letters</title><description>A notion of ω-rigid sets for a finite monoid is introduced. We prove that a finite monoid
M is the Arnold's syntactic monoid of some rational ω-language (ω-syntactic for short) if and only if there exists an ω-rigid set for
M. This property is shown to be decidable for the finite monoids. Relationship between the family of ω-syntactic monoids and that of ∗-syntactic monoids (i.e. the syntactic monoids of rational languages of finite words) is established.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Formal languages</subject><subject>Language theory and syntactical analysis</subject><subject>syntactic monoid</subject><subject>Theoretical computing</subject><subject>ω-languages</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNp9kMtKA0EQRRtRMEb_wMUsRHQx2tXPmY0gwUcg4EZx2XT6kbRMpmP3RMgn-HX-khMTsnRVVHHvraqD0DngG8AgbjEmuMRQ46uaXNcYKC_HB2gAlSSlAKgP0WAvOUYnOX9gjAWjcoBG7_Ng5oUPbehcsYhtDDYXOrkir9tOmy6Y_TT6IukuxFY3xc932eh2ttIzl0_RkddNdme7OkRvjw-vo-dy8vI0Ht1PSkOBd6WfWiK9FBwYAytZ33g8tZXmnlUSC8GYtYxoT7EwrOJSgK24IZwDBYolHaLLbe4yxc-Vy51ahGxc0x_i4iorwmvKgdNeyLZCk2LOyXm1TGGh01oBVhtiaoNDbXComqg_Ymrc2y52-Tob3fikWxPy3ssZhZps0u-2Mtf_-hVcUtkE1xpnQ3KmUzaG__f8Aj-kfhw</recordid><startdate>19920525</startdate><enddate>19920525</enddate><creator>Huy, Phan Trung</creator><creator>Livotsky, Igor</creator><creator>Van, Do Long</creator><general>Elsevier B.V</general><general>Elsevier Science</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>19920525</creationdate><title>Which finite monoids are syntactic monoids of rational ω-languages</title><author>Huy, Phan Trung ; Livotsky, Igor ; Van, Do Long</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c315t-fbd27f7651441d7427ff0bd8a5f48706644dd42af306c485761d85c2551313073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Formal languages</topic><topic>Language theory and syntactical analysis</topic><topic>syntactic monoid</topic><topic>Theoretical computing</topic><topic>ω-languages</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huy, Phan Trung</creatorcontrib><creatorcontrib>Livotsky, Igor</creatorcontrib><creatorcontrib>Van, Do Long</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>Huy, Phan Trung</au><au>Livotsky, Igor</au><au>Van, Do Long</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Which finite monoids are syntactic monoids of rational ω-languages</atitle><jtitle>Information processing letters</jtitle><date>1992-05-25</date><risdate>1992</risdate><volume>42</volume><issue>3</issue><spage>127</spage><epage>132</epage><pages>127-132</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>A notion of ω-rigid sets for a finite monoid is introduced. We prove that a finite monoid
M is the Arnold's syntactic monoid of some rational ω-language (ω-syntactic for short) if and only if there exists an ω-rigid set for
M. This property is shown to be decidable for the finite monoids. Relationship between the family of ω-syntactic monoids and that of ∗-syntactic monoids (i.e. the syntactic monoids of rational languages of finite words) is established.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0020-0190(92)90135-I</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 1992-05, Vol.42 (3), p.127-132 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_25935153 |
| source | Elsevier ScienceDirect Journals |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Formal languages Language theory and syntactical analysis syntactic monoid Theoretical computing ω-languages |
| title | Which finite monoids are syntactic monoids of rational ω-languages |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T18%3A16%3A28IST&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=Which%20finite%20monoids%20are%20syntactic%20monoids%20of%20rational%20%CF%89-languages&rft.jtitle=Information%20processing%20letters&rft.au=Huy,%20Phan%20Trung&rft.date=1992-05-25&rft.volume=42&rft.issue=3&rft.spage=127&rft.epage=132&rft.pages=127-132&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/0020-0190(92)90135-I&rft_dat=%3Cproquest_cross%3E25935153%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=25935153&rft_id=info:pmid/&rft_els_id=002001909290135I&rfr_iscdi=true |