Chao Yang , Ruiling Wu , Xiaobing Sun , Qichao Wang , Yongming Li
{"title":"Relative approximate bisimulations for fuzzy picture automata","authors":"Chao Yang , Ruiling Wu , Xiaobing Sun , Qichao Wang , 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":0.8000,"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 . 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.
期刊介绍:
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