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 条

[41] Products of lattice-valued fuzzy transition systems and induced fuzzy transformation semigroups [J].

Lizasoain, I. ;

Gomez, M. .

FUZZY SETS AND SYSTEMS, 2017, 317 :133-150

[42] Graded Computation Tree Logic with Binary Coding [J].

Bianco, Alessandro ;

Mogavero, Fabio ;

Murano, Aniello .

COMPUTER SCIENCE LOGIC, 2010, 6247 :125-139

[43] Characterizations of recognizable weighted tree languages by logic and bimorphisms [J].

Fulop, Zoltan ;

Vogler, Heiko .

SOFT COMPUTING, 2018, 22 (04) :1035-1046

[44] Some Results on Extension of Lattice-Valued XOR, XOR-Implications and E-Implications [J].

Palmeira, Eduardo ;

Bedregal, Benjamin .

INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS, IPMU 2016, PT II, 2016, 611 :809-820

[45] Automata- and logic-based pattern languages for tree-structured data [J].

Neven, F ;

Schwentick, T .

SEMANTICS IN DATABASES, 2003, 2582 :160-+

[46] Algebraic properties of complete residuated lattice valued tree automata [J].

M. Ghorani ;

M. M. Zahedi ;

R. Ameri .

Soft Computing, 2012, 16 :1723-1732

[47] A New Logic Optimization Algorithm of Multi-valued Logic Function Based on Two-valued Logic [J].

Qiu, Jianlin ;

Li, Fen ;

Gu, Xiang ;

Chen, Li ;

Chen, Yanyun .

FRONTIERS OF MANUFACTURING AND DESIGN SCIENCE II, PTS 1-6, 2012, 121-126 :4330-+

[48] AN AXIOMATIZABLE LATTICE-ORDERED LINGUISTIC TRUTH-VALUED LOGIC [J].

Liu, Jun ;

Xu, Yang ;

Ruan, Da .

COMPUTATIONAL INTELLIGENCE: FOUNDATIONS AND APPLICATIONS: PROCEEDINGS OF THE 9TH INTERNATIONAL FLINS CONFERENCE, 2010, 4 :72-+

[49] On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice [J].

Bou, Felix ;

Esteva, Francesc ;

Godo, Lluis ;

Oscar Rodriguez, Ricardo .

JOURNAL OF LOGIC AND COMPUTATION, 2011, 21 (05) :739-790

[50] Tree-Based Generation of Restricted Graph Languages [J].

Bjorklund, Henrik ;

Bjorklund, Johanna ;

Ericson, Petter .

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024, 35 (01N02) :215-243

← 1 2 3 4 5 →