State hyperstructures of tree automata based on lattice-valued logic

DOI10.1051/ita/2018004zbMath1400.68129OpenAlexW2813640253WikidataQ129539271 ScholiaQ129539271MaRDI QIDQ4553830

M. Ghorani

Publication date: 1 November 2018

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2018004

zbMATH Keywords

hypergroupminimizationlattice-valued logictree automatonKleene's theorem

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Fuzzy groups (20N25) Hypergroups (20N20)

Related Items (2)

Decidability of the minimization of fuzzy tree automata with membership values in complete lattices ⋮ Characterization of tree automata based on quantum logic

Cites Work

• Finite automata theory with membership values in lattices
• Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
• Minimization of states in automata theory based on finite lattice-ordered monoids
• Automata theory based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic. II
• Intuitionistic \((S,T)\)-fuzzy hyperquasigroups.
• Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
• Automata theory based on complete residuated lattice-valued logic: Pushdown automata
• Fuzzy \(H_v\)-groups
• Characterizations of fuzzy finite automata.
• Coding tree languages based on lattice-valued logic
• Characterizations of complete residuated lattice-valued finite tree automata
• Fuzzy tree language recognizability
• Equivalence in automata theory based on complete residuated lattice-valued logic
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• Fuzzy tree automata
• Algebraic properties of complete residuated lattice valued tree automata
• Determinization of fuzzy automata with membership values in complete residuated lattices
• Similarity-based minimization of fuzzy tree automata
• Fuzzy Tree Automata and Syntactic Pattern Recognition
• Deterministic Acceptors of Regular Fuzzy Languages
• Fuzzy sets
• General formulation of sequential machines
• A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: State hyperstructures of tree automata based on lattice-valued logic