Fuzzy tree automata
From MaRDI portal
Publication:2372277
Recommendations
Cites work
- scientific article; zbMATH DE number 3960988 (Why is no real title available?)
- scientific article; zbMATH DE number 3720983 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3493901 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 2040320 (Why is no real title available?)
- scientific article; zbMATH DE number 2040322 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Algebraic automata and context-free sets
- Effective construction of the syntactic algebra of a recognizable series on trees
- Equational elements in additive algebras
- Fuzzification of rational and recognizable sets
- Fuzzy regular languages over finite and infinite words
- Fuzzy sets
- Identities for globals (complex algebras) of algebras
- Infinite fuzzy computations
- Matrix and matricial iteration theories. I
- On the definition of a family of automata
- Recognizable formal power series on trees
- Universal algebra and applications in theoretical computer science
Cited in
(32)- scientific article; zbMATH DE number 5734005 (Why is no real title available?)
- Algebraic properties of complete residuated lattice valued tree automata
- Fuzzy regular languages over finite and infinite words
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Characterization of tree automata based on quantum logic
- MK-fuzzy automata and MSO logics
- Syntactic recognizability of graphs with fuzzy attributes
- On characterization of fuzzy tree pushdown automata
- McCarthy-Kleene fuzzy automata and MSO logics
- Nondeterministic fuzzy automata
- Some algebraic properties and corresponding language on finite fuzzy tree automata
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
- 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
- scientific article; zbMATH DE number 5846086 (Why is no real title available?)
- Characterizations of complete residuated lattice-valued finite tree automata
- Cut sets as recognizable tree languages
- Fuzzification of rational and recognizable sets
- scientific article; zbMATH DE number 1786609 (Why is no real title available?)
- State hyperstructures of tree automata based on lattice-valued logic
- Equational weighted tree transformations
- Synthesizing fuzzy tree automata
- 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
- scientific article; zbMATH DE number 7644294 (Why is no real title available?)
- 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)
