Fuzzy and non-deterministic automata

被引：38
|
作者：
J. Močkoř
机构：
[1] Department of Mathematics,
[2] Institute for Research and Applications of Fuzzy Modelling,undefined
[3] University of Ostrava,undefined
[4] CZ-702 00 Ostrava e-mail: jiri.mockor@osu.cz,undefined
来源：
Soft Computing | 1999年 / 3卷 / 4期
关键词：
Fuzzy Automaton;
D O I：
10.1007/s005000050091
中图分类号：
学科分类号：
摘要：
 The existence of isomorphism between the category of fuzzy automata and the category of chains of non-deterministic automata is proved and some relationships between output fuzzy sets of these systems are investigated.
引用
收藏
页码：221 / 226
页数：5
相关论文
共 50 条
  • [21] Language containment of non-deterministic omega-automata
    Tasiran, S
    Hojati, R
    Brayton, RK
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, 1995, 987 : 261 - 277
  • [22] NON-DETERMINISTIC FUNCTIONS AS NON-DETERMINISTIC PROCESSES
    Paulus, Joseph W. N.
    Nantes-Sobrinho, Daniele
    Perez, Jorge A.
    LOGICAL METHODS IN COMPUTER SCIENCE, 2023, 19 (04) : 1 - 1
  • [23] VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
    Lengal, Ondrej
    Simacek, Jiri
    Vojnar, Tomas
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2012, 2012, 7214 : 79 - 94
  • [24] Non-deterministic weighted automata evaluated over Markov chains
    Michaliszyn, Jakub
    Otop, Jan
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 108 : 118 - 136
  • [25] USING SAT SOLVERS FOR SYNCHRONIZATION ISSUES IN NON-DETERMINISTIC AUTOMATA
    Shabana, Hanan
    Volkov, Mikhail V.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2018, 15 : 1426 - 1442
  • [26] SOME EXTENSIONS OF CONGRUENCE CONCEPT FOR INCOMPLETE NON-DETERMINISTIC AUTOMATA
    YEH, RT
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1969, 288 (06): : 499 - &
  • [27] ON PRIMENESS OF NON-DETERMINISTIC AUTOMATA ASSOCIATED WITH INPUT SEMIGROUP S
    Shaheen, Salma
    Shabir, Muhammad
    TWMS JOURNAL OF PURE AND APPLIED MATHEMATICS, 2018, 9 (02): : 223 - 230
  • [28] NON-DETERMINISTIC 2-TAPE AUTOMATA ARE MORE POWERFUL THAN DETERMINISTIC ONES
    BRAUER, W
    LANGE, KJ
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 182 : 71 - 79
  • [29] Designing a Bangla Parser using Non-Deterministic Push Down Automata
    Rahman, Md. Mostafizur
    Abdulla-Al-Sun, Md.
    Hasan, K. M. Azharul
    Shuvo, Mohammad Insanur Rahman
    2017 INTERNATIONAL CONFERENCE ON ELECTRICAL, COMPUTER AND COMMUNICATION ENGINEERING (ECCE), 2017, : 571 - 576
  • [30] The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata
    Dubov, Yulia
    Kaminski, Michael
    LANGUAGES: FROM FORMAL TO NATURAL: ESSAYS DEDICATED TO NISSIM FRANCEZ ON THE OCCASION OF HIS 65TH BIRTHDAY, 2009, 5533 : 107 - +
12345