Relative approximate bisimulations for fuzzy picture automata

IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Information and Computation Pub Date : 2024-05-15 DOI:10.1016/j.ic.2024.105172
Chao Yang , Ruiling Wu , Xiaobing Sun , Qichao Wang , Yongming Li
{"title":"Relative approximate bisimulations for fuzzy picture automata","authors":"Chao Yang ,&nbsp;Ruiling Wu ,&nbsp;Xiaobing Sun ,&nbsp;Qichao Wang ,&nbsp;Yongming Li","doi":"10.1016/j.ic.2024.105172","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we firstly give the notion of relative <em>ϵ</em>-approximate bisimulations between two fuzzy two-dimensional on-line tessellation automata (F2OTAs) and elaborate that the relative error between two F2OTAs, accompanying with a relative <em>ϵ</em>-approximate bisimulation between them, is less than or equal to <em>ϵ</em> where <span><math><mi>ϵ</mi><mo>∈</mo><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span>. Moreover, if relative <em>ϵ</em>-approximate bisimulations between two F2OTAs are restricted to be surjective functional, then some properties are drawn and by which relative <em>ϵ</em>-approximate bisimulations on a F2OTA are defined. We construct the factor F2OTA of a F2OTA with respect to a relative <em>ϵ</em>-approximate bisimulation on it and describe the relationship between this factor automaton and the original F2OTA. Whereafter, we novelly design two algorithms to compute all maximal relative <em>ϵ</em>-approximate bisimulations on a given F2OTA. Finally, we discuss some interesting properties of bisimulations on F2OTAs.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105172"},"PeriodicalIF":1.0000,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540124000373","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we firstly give the notion of relative ϵ-approximate bisimulations between two fuzzy two-dimensional on-line tessellation automata (F2OTAs) and elaborate that the relative error between two F2OTAs, accompanying with a relative ϵ-approximate bisimulation between them, is less than or equal to ϵ where ϵ[0,1]. Moreover, if relative ϵ-approximate bisimulations between two F2OTAs are restricted to be surjective functional, then some properties are drawn and by which relative ϵ-approximate bisimulations on a F2OTA are defined. We construct the factor F2OTA of a F2OTA with respect to a relative ϵ-approximate bisimulation on it and describe the relationship between this factor automaton and the original F2OTA. Whereafter, we novelly design two algorithms to compute all maximal relative ϵ-approximate bisimulations on a given F2OTA. Finally, we discuss some interesting properties of bisimulations on F2OTAs.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
模糊图象自动机的相对近似二拟合
本文首先给出了两个模糊二维在线分解自动机(F2OTA)之间的相对ϵ-近似二拟合的概念,并阐述了两个F2OTA之间的相对误差,伴随着它们之间的相对ϵ-近似二拟合,小于或等于ϵ,其中ϵ∈[0,1]。此外,如果限制两个 F2OTA 之间的相对ϵ-近似二似为射函数,那么就可以得出一些性质,并通过这些性质定义 F2OTA 上的相对ϵ-近似二似。我们根据 F2OTA 上的相对ϵ-近似二拟合构建了 F2OTA 的因子 F2OTA,并描述了该因子自动机与原始 F2OTA 之间的关系。此后,我们新颖地设计了两种算法来计算给定 F2OTA 上的所有最大相对ϵ 近似二拟态。最后,我们讨论了 F2OTA 上二拟合的一些有趣性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information and Computation
Information and Computation 工程技术-计算机:理论方法
CiteScore
2.30
自引率
0.00%
发文量
119
审稿时长
140 days
期刊介绍: Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking
期刊最新文献
Total conditional complexity of certain objects Corrigendum to “On the equivalence of uniform key agreement and sequential composition insecurity” [Information and Computation 307 (2025) 105365] A perfect matching reciprocity method for embedding multiple hypercubes in an augmented cube: Application to Hamiltonian decomposition Improved approximations for the capacitated vehicle routing problem with fixed capacity Deterministic pushdown automata with translucent input letters
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1