Coding tree languages based on lattice-valued logic
From MaRDI portal
Publication:1701899
DOI10.1007/S00500-016-2031-3zbMATH Open1425.68201OpenAlexW2255992692MaRDI QIDQ1701899FDOQ1701899
Authors: M. Ghorani, M. M. Zahedi 
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
Recommendations
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- State hyperstructures of tree automata based on lattice-valued logic
- Algebraic properties of complete residuated lattice valued tree automata
- Characterizations of complete residuated lattice-valued finite tree automata
- \(L\)-valued alternating tree automata
Cites Work
- On Fuzzy Logic I Many‐valued rules of inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Characterizations of fuzzy finite automata.
- 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
- On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
- On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Tree acceptors and some of their applications
- Semirings and pseudo MV algebras
- Automata theory based on lattice-ordered semirings
- Fuzzy discrete structures
- Fuzzy tree automata
- Title not available (Why is that?)
- Semigroup homomorphisms and fuzzy automata
- Algebraic properties on the cuts of lattice-valued regular languages
- The power of bootstrap tests of cointegration rank
- Isomorphism between two BL-general fuzzy automata
- Fuzzy grammar theory based on lattices
- Algebraic properties of complete residuated lattice valued tree automata
Cited In (9)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Characterization of tree automata based on quantum logic
- On characterization of fuzzy tree pushdown automata
- Graded Computation Tree Logic with Binary Coding
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- State hyperstructures of tree automata based on lattice-valued logic
- Computation tree measurement language (CTML)
- Title not available (Why is that?)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties
This page was built for publication: Coding tree languages based on lattice-valued logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701899)
