Continuous logic in problems of finite automata dynamics

被引：0
|
作者：
Levin, V. I. [1 ]
机构：
[1] Pensa State Technol Acad, Penza 440605, Russia
来源：
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL | 2010年 / 49卷 / 01期
关键词：
System Science International; Symbolic Representation; Finite Automaton; Input Action; Finite State Automaton;
D O I：
10.1134/S1064230710010077
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A technique for ordering, classification, and unification of fuzzy (continuous) logic formulas describing dynamical processes in finite automata is proposed. On the example of the class of automata without memory and with simplest input action, it is shown that the technique makes it possible to significantly (in several times) reduce the number of necessary formulas.
引用
收藏
页码：59 / 64
页数：6
相关论文
共 50 条
  • [21] ON CONTINUOUS-FUNCTIONS COMPUTED BY FINITE AUTOMATA
    DERENCOURT, D
    KARHUMAKI, J
    LATTEUX, M
    TERLUTTE, A
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1994, 28 (3-4): : 387 - 403
  • [22] Advances on algorithms for problems of resetting finite automata
    Zhu K.
    Wu G.
    Liang Z.
    Yuan M.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2021, 49 (02): : 20 - 27
  • [23] Problems on Finite Automata and the Exponential Time Hypothesis
    Fernau, Henning
    Krebs, Andreas
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2016, 9705 : 89 - 100
  • [24] The Complexity of Compressed Membership Problems for Finite Automata
    Jez, Artur
    THEORY OF COMPUTING SYSTEMS, 2014, 55 (04) : 685 - 718
  • [25] The Complexity of Compressed Membership Problems for Finite Automata
    Artur Jeż
    Theory of Computing Systems, 2014, 55 : 685 - 718
  • [26] PROBLEMS IN THEORY OF CRYPTANALYTICAL INVERTIBILITY OF FINITE AUTOMATA
    Agibalov, G. P.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2020, (50): : 62 - 71
  • [27] Possible inverse problems of finite automata diagnostics
    Sklyarevich, A.N., 1600,
  • [28] Problems on finite automata and the exponential time hypothesis
    Fernau H.
    Krebs A.
    Algorithms, 2017, 10 (01):
  • [29] GENERALIZED DIAGNOSIS AND SETTING PROBLEMS FOR FINITE AUTOMATA
    SPIVAK, MA
    ENGINEERING CYBERNETICS, 1969, (03): : 72 - &
  • [30] A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata
    Shang, Yun
    Lu, Xian
    Lu, Ruqian
    THEORETICAL COMPUTER SCIENCE, 2012, 434 : 53 - 86
12345