Fuzzy alternating automata over distributive lattices
From MaRDI portal
Publication:781276
DOI10.1016/J.INS.2017.10.015zbMATH Open1436.68190OpenAlexW2761350507WikidataQ62038052 ScholiaQ62038052MaRDI QIDQ781276FDOQ781276
Authors: Xiujuan Wei, Yongming Li
Publication date: 16 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.10.015
Recommendations
- Fuzzy alternating Büchi automata over distributive lattices
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Nondeterministic fuzzy automata
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Constructions for alternating finite automata∗
Cites Work
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- Alternation
- Nondeterministic fuzzy automata
- Determinism and fuzzy automata
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Title not available (Why is that?)
- An automata-theoretic approach to branching-time model checking
- Weak alternating automata are not that weak
- Alternating Weighted Automata
- Lattice Automata
- Title not available (Why is that?)
- Quantitative analysis of lattice-valued Kripke structures
- Quantitative model checking of linear-time properties based on generalized possibility measures
- Model checking of linear-time properties in multi-valued systems
- Max and sum semantics for alternating weighted automata
Cited In (6)
- Fuzzy alternating Büchi automata over distributive lattices
- Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them
- Title not available (Why is that?)
- Title not available (Why is that?)
- On typical hesitant fuzzy languages and automata
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
This page was built for publication: Fuzzy alternating automata over distributive lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781276)