Coding tree languages based on lattice-valued logic

被引：9
|
作者：
Ghorani, M. [1 ]
Zahedi, M. M. [2 ]
机构：
[1] Shahrood Univ Technol, Fac Math Sci, Shahrood, Iran
[2] Grad Univ Adv Technol, Dept Math, Kerman, Iran
来源：
SOFT COMPUTING | 2017年 / 21卷 / 14期
关键词：
Lattice-valued tree automata; Coding tree language; Pumping lemma; Closure property; FUZZY LOGIC; ALGEBRAIC PROPERTIES; PUMPING LEMMA; AUTOMATA; MINIMIZATION;
D O I：
10.1007/s00500-016-2031-3
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We consider tree automata based on complete residuated lattice-valued (for simplicity we write L-valued) logic. First, we define the concepts of response function and accessible states (with threshold c) of an L-valued tree automaton. Thereafter, we consider coding of trees and investigate the relation between response function on trees and their coding. Using the provided theorems, we give a pumping lemma for recognizable coding tree languages with threshold c. Moreover, we consider closure properties of recognizable coding tree languages. In this regard, we show that the class of recognizable coding tree languages with threshold c is closed under projection, intersection and union.
引用
收藏
页码：3815 / 3825
页数：11
相关论文
共 50 条
  • [31] Tautologies in some lattice-valued logic systems
    Li, HM
    Qin, KY
    Xu, Y
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 2563 - 2568
  • [32] Multiary α-Resolution Principle for a Lattice-Valued Logic
    Xu, Yang
    Liu, Jun
    Zhong, Xiaomei
    Chen, Shuwei
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2013, 21 (05) : 898 - 912
  • [33] α-Minimal Resolution Principle For A Lattice-Valued Logic
    Hairui Jia
    Yang Xu
    Yi Liu
    Jun Liu
    International Journal of Computational Intelligence Systems, 2015, 8 (1) : 34 - 43
  • [34] α-Lock paramodulation for lattice-valued propositional logic
    He, Xingxing
    Xu, Yang
    Liu, J.
    2015 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND KNOWLEDGE ENGINEERING (ISKE), 2015, : 18 - 20
  • [35] A Duality for Algebras of Lattice-Valued Modal Logic
    Maruyama, Yoshihiro
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, 2009, 5514 : 281 - 295
  • [36] Progress and prospect in lattice-valued logic systems based on lattice implication algebras
    Xu, Y
    Ruan, D
    Liu, J
    APPLIED COMPUTATIONAL INTELLIGENCE, 2004, : 29 - 34
  • [37] Algebraic properties on the cuts of lattice-valued regular languages
    Changjian Liang
    Yongming Li
    Soft Computing, 2008, 12 : 1049 - 1057
  • [38] Equivalence in automata theory based on complete residuated lattice-valued logic
    Xing, Hongyan
    Qiu, Damen
    Liu, Fuchun
    Fan, Zhujun
    FUZZY SETS AND SYSTEMS, 2007, 158 (13) : 1407 - 1422
  • [39] Algebraic properties on the cuts of lattice-valued regular languages
    Liang, Changjian
    Li, Yongming
    SOFT COMPUTING, 2008, 12 (11) : 1049 - 1057
  • [40] A linguistic truth-valued uncertainty reasoning model based on lattice-valued logic
    Chen, SW
    Xu, Y
    Ma, J
    FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 276 - 284
12345