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 条
[21]   Automata theory based on complete residuated lattice-valued logic: Reduction and minimization [J].
Wu, Lihua ;
Qiu, Daowen .
FUZZY SETS AND SYSTEMS, 2010, 161 (12) :1635-1656
[22]   L-TAUTOLOGY THEORY IN LATTICE-VALUED PROPOSITIONAL LOGIC [J].
Pan, Xiaodong ;
Xu, Kaijun ;
Qin, Keyun ;
Xu, Yang .
COMPUTATIONAL INTELLIGENCE: FOUNDATIONS AND APPLICATIONS: PROCEEDINGS OF THE 9TH INTERNATIONAL FLINS CONFERENCE, 2010, 4 :105-+
[23]   Lattice-valued finite state machines and lattice-valued transformation semigroups [J].
Gomez, M. ;
Lizasoain, I. ;
Moreno, C. .
FUZZY SETS AND SYSTEMS, 2012, 208 :1-21
[24]   Uncertainty Reasoning based on Gradational Lattice-Valued First-Order Logic Lvfl [J].
Chang, Zhiyan ;
Xu, Yang ;
Du, Weifeng ;
Wu, Minghui .
ISIP: 2009 INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING, PROCEEDINGS, 2009, :9-+
[25]   LINGUISTIC UNCERTAINTY REASONING BASED ON GRADATIONAL LATTICE-VALUED FIRST-ORDER LOGIC [J].
Chang, Zhiyan ;
Xu, Yang ;
He, Xingxing ;
Xu, Weitao ;
Zhong, Xiaomei .
INTELLIGENT DECISION MAKING SYSTEMS, VOL. 2, 2010, :649-654
[26]   Algebraic properties of complete residuated lattice valued tree automata [J].
Ghorani, M. ;
Zahedi, M. M. ;
Ameri, R. .
SOFT COMPUTING, 2012, 16 (10) :1723-1732
[27]   A unified algorithm for finding -IESFs in linguistic truth-valued lattice-valued propositional logic [J].
He, Xingxing ;
Xu, Yang ;
Liu, Jun ;
Chen, Shuwei .
SOFT COMPUTING, 2014, 18 (11) :2135-2147
[28]   Determination of α-resolution in lattice-valued first-order logic LF(X) [J].
Xu, Yang ;
Liu, Jun ;
Ruan, Da ;
Li, Xiaobing .
INFORMATION SCIENCES, 2011, 181 (10) :1836-1862
[29]   Lattice-Valued Binary Decision Diagrams [J].
Geeraerts, Gilles ;
Kalyon, Gabriel ;
Le Gall, Tristan ;
Maquet, Nicolas ;
Raskin, Jean-Francois .
AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2010, 6252 :158-172
[30]   Kronecker Products of Lattice-valued Finite Automata [J].
Liu, Jun ;
Sun, Su-qin ;
Ou, Xiao-hua .
ICCSIT 2010 - 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 3, 2010, :617-620
12345