Equivalence in automata theory based on complete residuated lattice-valued logic
From MaRDI portal
Publication:2372274
Recommendations
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
Cites work
- scientific article; zbMATH DE number 1183717 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3511971 (Why is no real title available?)
- scientific article; zbMATH DE number 3623470 (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?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3264081 (Why is no real title available?)
- scientific article; zbMATH DE number 3269042 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Comments on the Minimization of Stochastic Machines
- Deterministic Acceptors of Regular Fuzzy Languages
- Equivalence, reduction and minimization of finite automata over semirings
- Equivalence, reduction and minimization of finite fuzzy-automata
- Finite L-fuzzy machines.
- Fuzzy automata and languages
- Fuzzy discrete structures
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Fuzzy language on free monoid
- Max-product machines
- Maximin automata
- Minimization of fuzzy finite automata
- On Fuzzy Logic I Many‐valued rules of inference
- On fuzzy regular languages
- On reductions of maximin machines
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Reduced forms for stochastic sequential machines
- Resolution of composite fuzzy relation equations
Cited in
(39)- Grammar theory based on lattice-ordered monoid
- Algebraic properties of complete residuated lattice valued tree automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Bisimulations for fuzzy automata
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- Weak bisimulations for fuzzy automata
- ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Automata theory based on complete residuated lattice-valued logic. II
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Myhill-Nerode type theory for fuzzy languages and automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Fuzzy relation equations and reduction of fuzzy automata
- 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
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- On minimal realization of fuzzy behaviour and associated categories
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Characterizations of complete residuated lattice-valued finite tree automata
- Construction of fuzzy automata from fuzzy regular expressions
- State hyperstructures of tree automata based on lattice-valued logic
- Minimal realization for fuzzy behaviour: a bicategory-theoretic approach
- scientific article; zbMATH DE number 7528980 (Why is no real title available?)
- Categories of quantale-valued fuzzy automata: determinization and minimization
- A categorical approach to minimal realization for a fuzzy language
- Weighted finite automata with output
- Formal power series and regular operations on fuzzy languages
- Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
- Algebraic properties of approximate bisimulation relations for fuzzy automata
- On closure properties of \(\mathcal{L}\)-valued linear languages
- Determinization of fuzzy automata via factorization of fuzzy states
- Coding tree languages based on lattice-valued logic
- Further improvements of determinization methods for fuzzy finite automata
This page was built for publication: Equivalence in automata theory based on complete residuated lattice-valued logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372274)
