Fuzzy multiset finite automata and their languages
Inspired by the generalizations from grammars and finite automata to fuzzy grammars and fuzzy finite automata, respectively, we introduce the concepts of fuzzy multiset grammars and fuzzy multiset finite automata (FMFAs), as the generalizations of multiset grammars and multiset finite automata, resp...
Gespeichert in:
| Veröffentlicht in: | Soft computing (Berlin, Germany) Germany), 2013-03, Vol.17 (3), p.381-390 |
|---|---|
| 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 | 390 |
|---|---|
| container_issue | 3 |
| container_start_page | 381 |
| container_title | Soft computing (Berlin, Germany) |
| container_volume | 17 |
| creator | Wang, Jinyan Yin, Minghao Gu, Wenxiang |
| description | Inspired by the generalizations from grammars and finite automata to fuzzy grammars and fuzzy finite automata, respectively, we introduce the concepts of fuzzy multiset grammars and fuzzy multiset finite automata (FMFAs), as the generalizations of multiset grammars and multiset finite automata, respectively. The relationship between fuzzy multiset regular grammars and FMFAs is discussed. Furthermore, we define some operations on fuzzy multiset languages, and prove that the family of FMFA languages is closed under the operations. |
| doi_str_mv | 10.1007/s00500-012-0913-6 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2917966395</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2917966395</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-8f4485d0486b87bdd8e00d41c9b65c02e84c4f1fd4a9e53a5c518dabfa168d203</originalsourceid><addsrcrecordid>eNp1kD1PwzAURS0EEqXwA9giMRuev-0RVRSQKrHAbDmxXVK1SbGdof31pASJiend4Z77pIPQLYF7AqAeMoAAwEAoBkMYlmdoRjhjWHFlzn8yxUpydomuct4AUKIEmyG6HI7HQ7UbtqXNoVSx7doSKjeUfueKq1znq_IZ2lRtXbce3Drka3QR3TaHm987Rx_Lp_fFC169Pb8uHle4YUQWrCPnWnjgWtZa1d7rAOA5aUwtRQM0aN7wSKLnzgTBnGgE0d7V0RGpPQU2R3fT7j71X0PIxW76IXXjS0sNUUZKZsTYIlOrSX3OKUS7T-3OpYMlYE9q7KTGjmrsSY2VI0MnJo_dbh3S3_L_0DdVbGW5</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2917966395</pqid></control><display><type>article</type><title>Fuzzy multiset finite automata and their languages</title><source>SpringerLink Journals</source><source>ProQuest Central UK/Ireland</source><source>ProQuest Central</source><creator>Wang, Jinyan ; Yin, Minghao ; Gu, Wenxiang</creator><creatorcontrib>Wang, Jinyan ; Yin, Minghao ; Gu, Wenxiang</creatorcontrib><description>Inspired by the generalizations from grammars and finite automata to fuzzy grammars and fuzzy finite automata, respectively, we introduce the concepts of fuzzy multiset grammars and fuzzy multiset finite automata (FMFAs), as the generalizations of multiset grammars and multiset finite automata, respectively. The relationship between fuzzy multiset regular grammars and FMFAs is discussed. Furthermore, we define some operations on fuzzy multiset languages, and prove that the family of FMFA languages is closed under the operations.</description><identifier>ISSN: 1432-7643</identifier><identifier>EISSN: 1433-7479</identifier><identifier>DOI: 10.1007/s00500-012-0913-6</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer-Verlag</publisher><subject>Artificial Intelligence ; Computational Intelligence ; Control ; Engineering ; Fuzzy sets ; Grammar ; Grammars ; Language ; Languages ; Mathematical Logic and Foundations ; Mechatronics ; Original Paper ; Robotics</subject><ispartof>Soft computing (Berlin, Germany), 2013-03, Vol.17 (3), p.381-390</ispartof><rights>Springer-Verlag 2012</rights><rights>Springer-Verlag 2012.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-8f4485d0486b87bdd8e00d41c9b65c02e84c4f1fd4a9e53a5c518dabfa168d203</citedby><cites>FETCH-LOGICAL-c316t-8f4485d0486b87bdd8e00d41c9b65c02e84c4f1fd4a9e53a5c518dabfa168d203</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00500-012-0913-6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2917966395?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,778,782,21371,27907,27908,33727,41471,42540,43788,51302,64366,64370,72220</link.rule.ids></links><search><creatorcontrib>Wang, Jinyan</creatorcontrib><creatorcontrib>Yin, Minghao</creatorcontrib><creatorcontrib>Gu, Wenxiang</creatorcontrib><title>Fuzzy multiset finite automata and their languages</title><title>Soft computing (Berlin, Germany)</title><addtitle>Soft Comput</addtitle><description>Inspired by the generalizations from grammars and finite automata to fuzzy grammars and fuzzy finite automata, respectively, we introduce the concepts of fuzzy multiset grammars and fuzzy multiset finite automata (FMFAs), as the generalizations of multiset grammars and multiset finite automata, respectively. The relationship between fuzzy multiset regular grammars and FMFAs is discussed. Furthermore, we define some operations on fuzzy multiset languages, and prove that the family of FMFA languages is closed under the operations.</description><subject>Artificial Intelligence</subject><subject>Computational Intelligence</subject><subject>Control</subject><subject>Engineering</subject><subject>Fuzzy sets</subject><subject>Grammar</subject><subject>Grammars</subject><subject>Language</subject><subject>Languages</subject><subject>Mathematical Logic and Foundations</subject><subject>Mechatronics</subject><subject>Original Paper</subject><subject>Robotics</subject><issn>1432-7643</issn><issn>1433-7479</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kD1PwzAURS0EEqXwA9giMRuev-0RVRSQKrHAbDmxXVK1SbGdof31pASJiend4Z77pIPQLYF7AqAeMoAAwEAoBkMYlmdoRjhjWHFlzn8yxUpydomuct4AUKIEmyG6HI7HQ7UbtqXNoVSx7doSKjeUfueKq1znq_IZ2lRtXbce3Drka3QR3TaHm987Rx_Lp_fFC169Pb8uHle4YUQWrCPnWnjgWtZa1d7rAOA5aUwtRQM0aN7wSKLnzgTBnGgE0d7V0RGpPQU2R3fT7j71X0PIxW76IXXjS0sNUUZKZsTYIlOrSX3OKUS7T-3OpYMlYE9q7KTGjmrsSY2VI0MnJo_dbh3S3_L_0DdVbGW5</recordid><startdate>20130301</startdate><enddate>20130301</enddate><creator>Wang, Jinyan</creator><creator>Yin, Minghao</creator><creator>Gu, Wenxiang</creator><general>Springer-Verlag</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope></search><sort><creationdate>20130301</creationdate><title>Fuzzy multiset finite automata and their languages</title><author>Wang, Jinyan ; Yin, Minghao ; Gu, Wenxiang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-8f4485d0486b87bdd8e00d41c9b65c02e84c4f1fd4a9e53a5c518dabfa168d203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Artificial Intelligence</topic><topic>Computational Intelligence</topic><topic>Control</topic><topic>Engineering</topic><topic>Fuzzy sets</topic><topic>Grammar</topic><topic>Grammars</topic><topic>Language</topic><topic>Languages</topic><topic>Mathematical Logic and Foundations</topic><topic>Mechatronics</topic><topic>Original Paper</topic><topic>Robotics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Jinyan</creatorcontrib><creatorcontrib>Yin, Minghao</creatorcontrib><creatorcontrib>Gu, Wenxiang</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</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>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Soft computing (Berlin, Germany)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Jinyan</au><au>Yin, Minghao</au><au>Gu, Wenxiang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fuzzy multiset finite automata and their languages</atitle><jtitle>Soft computing (Berlin, Germany)</jtitle><stitle>Soft Comput</stitle><date>2013-03-01</date><risdate>2013</risdate><volume>17</volume><issue>3</issue><spage>381</spage><epage>390</epage><pages>381-390</pages><issn>1432-7643</issn><eissn>1433-7479</eissn><abstract>Inspired by the generalizations from grammars and finite automata to fuzzy grammars and fuzzy finite automata, respectively, we introduce the concepts of fuzzy multiset grammars and fuzzy multiset finite automata (FMFAs), as the generalizations of multiset grammars and multiset finite automata, respectively. The relationship between fuzzy multiset regular grammars and FMFAs is discussed. Furthermore, we define some operations on fuzzy multiset languages, and prove that the family of FMFA languages is closed under the operations.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer-Verlag</pub><doi>10.1007/s00500-012-0913-6</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1432-7643 |
| ispartof | Soft computing (Berlin, Germany), 2013-03, Vol.17 (3), p.381-390 |
| issn | 1432-7643 1433-7479 |
| language | eng |
| recordid | cdi_proquest_journals_2917966395 |
| source | SpringerLink Journals; ProQuest Central UK/Ireland; ProQuest Central |
| subjects | Artificial Intelligence Computational Intelligence Control Engineering Fuzzy sets Grammar Grammars Language Languages Mathematical Logic and Foundations Mechatronics Original Paper Robotics |
| title | Fuzzy multiset finite automata and their 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-17T03%3A52%3A18IST&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=Fuzzy%20multiset%20finite%20automata%20and%20their%20languages&rft.jtitle=Soft%20computing%20(Berlin,%20Germany)&rft.au=Wang,%20Jinyan&rft.date=2013-03-01&rft.volume=17&rft.issue=3&rft.spage=381&rft.epage=390&rft.pages=381-390&rft.issn=1432-7643&rft.eissn=1433-7479&rft_id=info:doi/10.1007/s00500-012-0913-6&rft_dat=%3Cproquest_cross%3E2917966395%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=2917966395&rft_id=info:pmid/&rfr_iscdi=true |