Continuous logic in problems of finite automata dynamics

被引:0
|
作者
Levin, V. I. [1 ]
机构
[1] Pensa State Technol Acad, Penza 440605, Russia
关键词
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 条
  • [41] Intractability of decision problems for finite-memory automata
    Sakamoto, H
    Ikeda, D
    THEORETICAL COMPUTER SCIENCE, 2000, 231 (02) : 297 - 308
  • [42] The Parameterized Complexity of Chosen Problems for Finite Automata on Trees
    Barecka, Agata
    Charatonik, Witold
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 129 - +
  • [43] Decision Problems for Probabilistic Finite Automata on Bounded Languages
    Bell, Paul C.
    Halava, Vesa
    Hirvensalo, Mika
    FUNDAMENTA INFORMATICAE, 2013, 123 (01) : 1 - 14
  • [44] Finite Automata with Colored Accepting States and Their Unmixedness Problems
    Takahashi, Yoshiaki
    Ito, Akira
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2022, E105D (03) : 491 - 502
  • [45] Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
    Gimbert, Hugo
    Oualhadj, Youssouf
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, 2010, 6199 : 527 - +
  • [46] Promise problems solved by quantum and classical finite automata
    Zheng, Shenggen
    Li, Lvzhou
    Qiu, Daowen
    Gruska, Jozef
    THEORETICAL COMPUTER SCIENCE, 2017, 666 : 48 - 64
  • [47] SOME PROBLEMS OF CONSTRUCTIVE THEORIES OF FINITE STOCHASTIC AUTOMATA
    LORENTS, AA
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1968, 14 (05): : 413 - &
  • [48] THE PARALLEL COMPLEXITY OF FINITE-STATE AUTOMATA PROBLEMS
    SANG, C
    HUYNH, DT
    INFORMATION AND COMPUTATION, 1992, 97 (01) : 1 - 22
  • [49] LOGIC OF AUTOMATA
    GAINES, BR
    KOHOUT, LJ
    INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 1976, 2 (04) : 191 - 208
  • [50] Fuzzy logic and continuous cellular automata in Warfarin dosing of stroke patients
    Helgason C.M.
    Jobe T.H.
    Current Treatment Options in Cardiovascular Medicine, 2005, 7 (3) : 211 - 218