Fuzzy tree automata
From MaRDI portal
Publication:2372277
DOI10.1016/J.FSS.2007.02.016zbMATH Open1123.68057OpenAlexW1996783109MaRDI QIDQ2372277FDOQ2372277
Authors: Guangwu Liu, Zoltán Ésik 
Publication date: 26 July 2007
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2007.02.016
Recommendations
Cites Work
- Fuzzy sets
- Matrix and matricial iteration theories. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the definition of a family of automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universal algebra and applications in theoretical computer science
- Title not available (Why is that?)
- Identities for globals (complex algebras) of algebras
- Algebraic automata and context-free sets
- Fuzzification of rational and recognizable sets
- Title not available (Why is that?)
- Recognizable formal power series on trees
- Equational elements in additive algebras
- Title not available (Why is that?)
- Fuzzy regular languages over finite and infinite words
- Effective construction of the syntactic algebra of a recognizable series on trees
- Title not available (Why is that?)
- Infinite fuzzy computations
Cited In (32)
- Title not available (Why is that?)
- Fuzzy regular languages over finite and infinite words
- Algebraic properties of complete residuated lattice valued tree automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- MK-fuzzy automata and MSO logics
- Characterization of tree automata based on quantum logic
- Syntactic recognizability of graphs with fuzzy attributes
- On characterization of fuzzy tree pushdown automata
- McCarthy-Kleene fuzzy automata and MSO logics
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism
- Some algebraic properties and corresponding language on finite fuzzy tree automata
- Nondeterministic fuzzy automata
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- Title not available (Why is that?)
- Fuzzification of rational and recognizable sets
- Cut sets as recognizable tree languages
- Characterizations of complete residuated lattice-valued finite tree automata
- Title not available (Why is that?)
- State hyperstructures of tree automata based on lattice-valued logic
- Synthesizing fuzzy tree automata
- Equational weighted tree transformations
- Fuzzy tree language recognizability
- Principal abstract families of weighted tree languages
- Algebras of fuzzy sets
- Lattice-valued tree pushdown automata: pumping lemma and closure properties
- Coding tree languages based on lattice-valued logic
- Similarity-based minimization of fuzzy tree automata
- Title not available (Why is that?)
- The equivalence on two kinds of fuzzy tree automata
This page was built for publication: Fuzzy tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372277)
