Back to Search
Start Over
Characterizations of complete residuated lattice-valued finite tree automata
- Source :
-
Fuzzy Sets & Systems . Jul2012, Vol. 199, p28-46. 19p. - Publication Year :
- 2012
-
Abstract
- Abstract: This paper deals with the concept of complete residuated lattice-valued (referred to as -valued) finite tree automata. In this regard, we first define an -valued regular tree language, and then we prove a necessary and sufficient condition for the regularity of an -valued tree language. Furthermore, we generalize the pumping lemma for -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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 01650114
- Volume :
- 199
- Database :
- Academic Search Index
- Journal :
- Fuzzy Sets & Systems
- Publication Type :
- Academic Journal
- Accession number :
- 74551448
- Full Text :
- https://doi.org/10.1016/j.fss.2011.11.010