Characterizations of complete residuated lattice-valued finite tree automata

Authors:
M. Ghorani;M. M. Zahedi
Affiliations:
Department of Mathematics, Alzahra University, Tehran, Iran;Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran
Venue:
Fuzzy Sets and Systems
Year:
2012

Citing 12
Cited 0

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Automatic Ontology-Based Knowledge Extraction from Web Documents

IEEE Intelligent Systems
Minimization of states in automata theory based on finite lattice-ordered monoids

Information Sciences: an International Journal
A note on Trillas' CHC models

Artificial Intelligence
Equivalence in automata theory based on complete residuated lattice-valued logic

Fuzzy Sets and Systems
Minimization of lattice finite automata and its application to the decomposition of lattice languages

Fuzzy Sets and Systems
Fuzzy tree automata

Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: Pushdown automata

Fuzzy Sets and Systems
Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic

Fuzzy Sets and Systems
Fuzzy tree language recognizability

Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: Reduction and minimization

Fuzzy Sets and Systems
Supervisory control of fuzzy discrete event systems: a formal approach

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.20

Visualization

Abstract

This paper deals with the concept of complete residuated lattice-valued (referred to as L-valued) finite tree automata. In this regard, we first define an L-valued regular tree language, and then we prove a necessary and sufficient condition for the regularity of an L-valued tree language. Furthermore, we generalize the pumping lemma for L-valued finite tree automata (L-FTA). Afterwards, the behavior of L-FTA is addressed and some theorems are provided. Moreover, the existence of the minimal form of an L-FTA is considered. Finally, a minimization algorithm of the L-FTA is presented and its time complexity is analyzed.