不可约模糊多集有限自动机

IF 1.5 4区计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Journal Pub Date : 2023-01-22 DOI:10.1093/comjnl/bxac193

Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour

{"title":"不可约模糊多集有限自动机","authors":"Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour","doi":"10.1093/comjnl/bxac193","DOIUrl":null,"url":null,"abstract":"Abstract This study aims to investigate the algebraic properties of fuzzy multiset finite automaton (FMFA), giving a congruence relation. Using the equivalence classes, a minimal accessible complete FMFA is then presented. In addition, we define the concepts of admissible relation, admissible partition for FMFA and quotient FMFA. Further, we present an algorithm which determines an admissible partition for an FMFA and we suggest the time complexity of the algorithm. In particular, we introduce a connection between the admissible partition and the quotient FMFA and we show that any quotient of a given FMFA and the FMFA itself have the same language. Furthermore, using the quotient FMFA, we obtain an irreducible FMFA with the same language.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":"16 1","pages":"0"},"PeriodicalIF":1.5000,"publicationDate":"2023-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Irreducible Fuzzy Multiset Finite Automaton\",\"authors\":\"Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour\",\"doi\":\"10.1093/comjnl/bxac193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract This study aims to investigate the algebraic properties of fuzzy multiset finite automaton (FMFA), giving a congruence relation. Using the equivalence classes, a minimal accessible complete FMFA is then presented. In addition, we define the concepts of admissible relation, admissible partition for FMFA and quotient FMFA. Further, we present an algorithm which determines an admissible partition for an FMFA and we suggest the time complexity of the algorithm. In particular, we introduce a connection between the admissible partition and the quotient FMFA and we show that any quotient of a given FMFA and the FMFA itself have the same language. Furthermore, using the quotient FMFA, we obtain an irreducible FMFA with the same language.\",\"PeriodicalId\":50641,\"journal\":{\"name\":\"Computer Journal\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2023-01-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/comjnl/bxac193\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/comjnl/bxac193","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

摘要

摘要研究模糊多集有限自动机(FMFA)的代数性质，给出其同余关系。利用等价类，给出了一个最小可访问的完整FMFA。此外，我们定义了FMFA的可容许关系、可容许划分和商FMFA的概念。在此基础上，提出了一种确定FMFA可接受分区的算法，并给出了该算法的时间复杂度。特别地，我们引入了可容许划分与商FMFA之间的联系，并证明了给定FMFA的任何商与FMFA本身具有相同的语言。在此基础上，利用商FMFA，得到了具有相同语言的不可约FMFA。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Irreducible Fuzzy Multiset Finite Automaton

Abstract This study aims to investigate the algebraic properties of fuzzy multiset finite automaton (FMFA), giving a congruence relation. Using the equivalence classes, a minimal accessible complete FMFA is then presented. In addition, we define the concepts of admissible relation, admissible partition for FMFA and quotient FMFA. Further, we present an algorithm which determines an admissible partition for an FMFA and we suggest the time complexity of the algorithm. In particular, we introduce a connection between the admissible partition and the quotient FMFA and we show that any quotient of a given FMFA and the FMFA itself have the same language. Furthermore, using the quotient FMFA, we obtain an irreducible FMFA with the same language.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Computer Journal 工程技术-计算机：软件工程

CiteScore

3.60

自引率

7.10%

发文量

164

审稿时长

4.8 months

期刊介绍： The Computer Journal is one of the longest-established journals serving all branches of the academic computer science community. It is currently published in four sections.