TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
From MaRDI portal
Publication:4626611
DOI10.22111/ijfs.2018.4288zbMath1407.68254OpenAlexW2725627089MaRDI QIDQ4626611
Publication date: 28 February 2019
Full work available at URL: http://ijfs.usb.ac.ir/article_4288_3e544d513e159818da9cf9defba8ee1a.pdf
Formal languages and automata (68Q45) Fuzzy logic; logic of vagueness (03B52) Automata and formal grammars in connection with logical questions (03D05)
Related Items
Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, Lattice-valued tree pushdown automata: pumping lemma and closure properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The universal fuzzy automaton
- Computation tree logic model checking based on possibility measures
- Model checking fuzzy computation tree logic
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted finite automata over strong bimonoids
- 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
- Model checking computation tree logic over finite lattices
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Fuzzy relation equations and reduction of fuzzy automata
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- Minimization algorithm of fuzzy finite automata.
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results
- Coding tree languages based on lattice-valued logic
- Characterizations of complete residuated lattice-valued finite tree automata
- Isomorphism between two BL-general fuzzy automata
- Fuzzy tree language recognizability
- Reduction of nondeterministic tree automata
- 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
- Skew residuated lattices
- The complexity of computing the behaviour of lattice automata on infinite trees
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Tree acceptors and some of their applications
- Max-product machines
- Similarity-based minimization of fuzzy tree automata
- Minimization of Deterministic Fuzzy Tree Automata
- On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
- Factorization of Fuzzy Automata
- Lattice Automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
