Automata, Languages, and Machines
Automata, Languages, and Machines
Fuzzy Sets and Systems: Theory and Applications
Fuzzy Sets and Systems: Theory and Applications
Fuzzy Switching and Automata: Theory and Applications
Fuzzy Switching and Automata: Theory and Applications
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Fuzzy Sets and Systems
On the recognizability of fuzzy languages II
Fuzzy Sets and Systems
Modeling and control of fuzzy discrete event systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Supervisory control of fuzzy discrete event systems: a formal approach
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Computing with words via Turing machines: a formal approach
IEEE Transactions on Fuzzy Systems
Determinization of weighted finite automata over strong bimonoids
Information Sciences: an International Journal
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Characterizations of complete residuated lattice-valued finite tree automata
Fuzzy Sets and Systems
| Hi-index | 0.20 |
A fuzzy tree language with membership grades in an arbitrary set is syntactically recognizable (s-recognizable) if its syntactic algebra is finite. The equality problem for such languages is decidable and their syntactic algebra can be effectively constructed provided that they are s-recognizable. Linear (but non arbitrary) tree homomorphisms preserve s-recognizability. Tree automata whose transitions are weighted over the unit interval and whose behavior is computed with respect to a pair made of a t-norm distributive over a t-conorm have the syntactic recognition power and thus their equivalence problem is decidable. However, s-recognizability is more powerful when dealing with non-distributive pairs of such operations.