Nondeterministic fuzzy automata with membership values in complete residuated lattices
From MaRDI portal
Publication:511624
DOI10.1016/J.IJAR.2016.11.020zbMATH Open1404.68072DBLPjournals/ijar/PanLCL17OpenAlexW2559616919WikidataQ62038067 ScholiaQ62038067MaRDI QIDQ511624FDOQ511624
Authors: Haiyu Pan, Yongzhi Cao, Ping Li, Yongming Li 
Publication date: 22 February 2017
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2016.11.020
Recommendations
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Automata theory based on complete residuated lattice-valued logic. II
- GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
Cites Work
- Alternating-time temporal logic
- Metamathematics of fuzzy logic
- Title not available (Why is that?)
- Bisimulations for fuzzy automata
- Title not available (Why is that?)
- Nondeterministic fuzzy automata
- A note on Trillas' CHC models
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Characterizations of fuzzy finite automata.
- On approximate minimization of fuzzy automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Finite automata theory with membership values in lattices
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Fuzzy relation equations and reduction of fuzzy automata
- Title not available (Why is that?)
- Approximation and robustness of fuzzy finite automata
- The relationships among several types of fuzzy automata
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Quantitative analysis of weighted transition systems
- A categorical approach to lattice-valued fuzzy automata
- Algebraic properties of \(LA\)-languages
- Lattice Automata
- Formalization of implication based fuzzy reasoning method
- The completeness and applications of the formal system \(\mathcal L^\ast\)
- Hierarchical structure and applications of fuzzy logical systems
- Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity
- Simulation for lattice-valued doubly labeled transition systems
- Lattice-valued simulations for quantitative transition systems
- A modal characterization of alternating approximate bisimilarity
- A behavioural pseudometric based on \(\lambda\)-bisimilarity
- The dual equivalence of equations and coequations for automata
- Model checking discounted temporal properties
- Quantitative analysis of lattice-valued Kripke structures
- On modeling of fuzzy hybrid systems
- Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Coalgebraic constructions of canonical nondeterministic automata
Cited In (24)
- GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
- Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems
- On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization
- Limited approximate bisimulations and the corresponding rough approximations
- Nondeterministic fuzzy automata
- Generalized possibility computation tree logic with frequency and its model checking
- Automata theory based on complete residuated lattice-valued logic
- Characterization and computation of approximate bisimulations for fuzzy automata
- Bisimulations for fuzzy transition systems revisited
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
- Fuzzy alternating Büchi automata over distributive lattices
- Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them
- Determinization of fuzzy automata with membership values in complete residuated lattices
- The relationships among several forms of weighted finite automata over strong bimonoids
- Fuzzy alternating automata over distributive lattices
- TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
- Title not available (Why is that?)
- The relationships among several types of fuzzy automata
- Lattice-valued tree pushdown automata: pumping lemma and closure properties
- Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation
- On typical hesitant fuzzy languages and automata
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
This page was built for publication: Nondeterministic fuzzy automata with membership values in complete residuated lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511624)
