Finite tree automata with cost functions
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
On a generalization of fuzzy algebras and congruences
Fuzzy Sets and Systems
Handbook of formal languages, vol. 3
Positive tree representations and applications to tree automata
Information and Computation
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
Completion of ordered structures by cuts of fuzzy sets: an overview
Fuzzy Sets and Systems - Logic and algebra
Representing ordered structures by fuzzy sets: an overview
Fuzzy Sets and Systems - Logic and algebra
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
A Kleene Theorem for Weighted Tree Automata
Theory of Computing Systems
Weighted tree automata and weighted logics
Theoretical Computer Science
A note on cut-worthiness of recognizable tree series
Fuzzy Sets and Systems
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
On lattice valued up-sets and down-sets
Fuzzy Sets and Systems
Weighted tree-walking automata
Acta Cybernetica
Hi-index | 0.21 |
A tree series over a semiring with partially ordered carrier set can be considered as a fuzzy set. We investigate conditions under which it can also be understood as a fuzzified recognizable tree language. In this sense, sufficient conditions are presented which, when imposed, ensure that every cut set, i.e., the pre-image of a prime filter of the carrier set, is a recognizable tree language. Moreover, such conditions are also presented for cut sets of recognizable tree series.