TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
From MaRDI portal
(Redirected from Publication:4626611)
Recommendations
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Algebraic properties of complete residuated lattice valued tree automata
- Characterizations of complete residuated lattice-valued finite tree automata
- 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: Turing machines
- State hyperstructures of tree automata based on lattice-valued logic
- scientific article; zbMATH DE number 3976378
- scientific article; zbMATH DE number 7649889
Cites work
- A uniform (bi-)simulation-based framework for reducing tree automata
- 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: Reduction and minimization
- Characterizations of complete residuated lattice-valued finite tree automata
- Classes of residuated lattices
- Coding tree languages based on lattice-valued logic
- Computation tree logic model checking based on possibility measures
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Factorization of Fuzzy Automata
- Fuzzy relation equations and reduction of fuzzy automata
- Fuzzy tree automata
- Fuzzy tree language recognizability
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 512856 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- Isomorphism between two BL-general fuzzy automata
- Lattice Automata
- Max-product machines
- Minimization algorithm of fuzzy finite automata.
- Minimization of deterministic fuzzy tree automata
- 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
- Model checking computation tree logic over finite lattices
- Model checking fuzzy computation tree logic
- New direction in fuzzy tree automata
- On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Reduction of nondeterministic tree automata
- Similarity-based minimization of fuzzy tree automata
- Skew residuated lattices
- The complexity of computing the behaviour of lattice automata on infinite trees
- The universal fuzzy automaton
- Tree acceptors and some of their applications
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted finite automata over strong bimonoids
Cited in
(9)- Coding tree languages based on lattice-valued logic
- Characterizations of complete residuated lattice-valued finite tree automata
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Lattice-valued tree pushdown automata: pumping lemma and closure properties
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- Algebraic properties of complete residuated lattice valued tree automata
- L-valued alternating tree automata
- State hyperstructures of tree automata based on lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
This page was built for publication: TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626611)
