Coding tree languages based on lattice-valued logic

DOI10.1007/s00500-016-2031-3zbMath1425.68201OpenAlexW2255992692MaRDI QIDQ1701899

M. M. Zahedi, M. Ghorani

Publication date: 27 February 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-016-2031-3

zbMATH Keywords

closure propertypumping lemmacoding tree languagelattice-valued tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Fuzzy logic; logic of vagueness (03B52)

Related Items

Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, State hyperstructures of tree automata based on lattice-valued logic, On characterization of fuzzy tree pushdown automata, TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS, Lattice-valued tree pushdown automata: pumping lemma and closure properties, Characterization of tree automata based on quantum logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata theory based on lattice-ordered semirings
• 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
• Algebraic properties on the cuts of lattice-valued regular languages
• Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
• Automata theory based on complete residuated lattice-valued logic: Pushdown automata
• Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
• Semigroup homomorphisms and fuzzy automata
• Characterizations of fuzzy finite automata.
• Characterizations of complete residuated lattice-valued finite tree automata
• Isomorphism between two BL-general fuzzy automata
• Fuzzy grammar theory based on lattices
• The power of bootstrap tests of cointegration rank
• 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
• Tree acceptors and some of their applications
• Semirings and pseudo MV algebras
• On Fuzzy Logic I Many‐valued rules of inference
• On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
• On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Fuzzy discrete structures