0

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. the resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. the most comprehensible decision trees have been designed for perfect symbolic data. classical crisp decision trees (dt) are widely applied to classification t...

Results of damage prediction in buildings can be used as a useful tool for managing and decreasing seismic risk of earthquakes. In this study, damage spectrum and C4.5 decision tree algorithm were utilized for damage prediction in steel buildings during earthquakes. In order to prepare the damage spectrum, steel buildings were modeled as a single-degree-of-freedom (SDOF) system and time-history...

In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...

Physiological processes cause movements of tree stems and branches that occur in a circadian rhythm over longer time periods, but there is lack quantitative understanding the cause-and-effect relationships. We investigated movement long-term drought experiment at scale using time-series terrestrial laser scanning measurements coupled with environmental drivers water status. Our results showed w...

Abstract We say that a graph can be embedded into if contains an isomorphic copy of as subgraph. Guo and Volkmann conjectured is connected with at least vertices minimum degree , then any tree maximum most . In this paper, we give result slightly stronger than conjecture obtain sufficient necessary condition G Our implies the true one exception. also application to Ramsey number versus star.