State hyperstructures of tree automata based on lattice-valued logic
From MaRDI portal
Recommendations
- Algebraic properties of complete residuated lattice valued tree automata
- Characterizations of complete residuated lattice-valued finite tree automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Congruence and homomorphism of lattice-valued tree automata
- Coding tree languages based on lattice-valued logic
Cites work
- scientific article; zbMATH DE number 430398 (Why is no real title available?)
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 18280 (Why is no real title available?)
- scientific article; zbMATH DE number 3493901 (Why is no real title available?)
- scientific article; zbMATH DE number 1225624 (Why is no real title available?)
- scientific article; zbMATH DE number 1271392 (Why is no real title available?)
- scientific article; zbMATH DE number 1053095 (Why is no real title available?)
- scientific article; zbMATH DE number 2040322 (Why is no real title available?)
- scientific article; zbMATH DE number 1924164 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 860103 (Why is no real title available?)
- scientific article; zbMATH DE number 860125 (Why is no real title available?)
- scientific article; zbMATH DE number 860126 (Why is no real title available?)
- scientific article; zbMATH DE number 908718 (Why is no real title available?)
- scientific article; zbMATH DE number 3018150 (Why is no real title available?)
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Algebraic properties of complete residuated lattice valued tree automata
- Alternating regular tree grammars in the framework of lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Characterizations of complete residuated lattice-valued finite tree automata
- Characterizations of fuzzy finite automata.
- Coding tree languages based on lattice-valued logic
- Deterministic Acceptors of Regular Fuzzy Languages
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Finite automata theory with membership values in lattices
- Fuzzy Tree Automata and Syntactic Pattern Recognition
- Fuzzy H_v-groups
- Fuzzy sets
- Fuzzy tree automata
- Fuzzy tree language recognizability
- General formulation of sequential machines
- Hypergroups and general fuzzy automata.
- Intuitionistic (S,T)-fuzzy hyperquasigroups.
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Minimization of states in automata theory based on finite lattice-ordered monoids
- On fuzzy relations and fuzzy subhypergroups
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Similarity-based minimization of fuzzy tree automata
Cited in
(10)- Algebraic properties of complete residuated lattice valued tree automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- L-valued alternating tree automata
- Characterization of tree automata based on quantum logic
- Alternating regular tree grammars in the framework of lattice-valued logic
- scientific article; zbMATH DE number 850632 (Why is no real title available?)
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- Characterizations of complete residuated lattice-valued finite tree automata
- Congruence and homomorphism of lattice-valued tree automata
- Coding tree languages based on lattice-valued logic
This page was built for publication: State hyperstructures of tree automata based on lattice-valued logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553830)
