Fuzzy alternating automata over distributive lattices

DOI10.1016/j.ins.2017.10.015zbMath1436.68190OpenAlexW2761350507WikidataQ62038052 ScholiaQ62038052MaRDI QIDQ781276

Xiujuan Wei, Yong-Ming 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

zbMATH Keywords

distributive latticesalternating automatafuzzy alternating automatafuzzy positive Boolean formulas

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Unnamed Item, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nondeterministic fuzzy automata
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Quantitative model checking of linear-time properties based on generalized possibility measures
• Determinism and fuzzy automata
• Model checking of linear-time properties in multi-valued systems
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• Max and Sum Semantics for Alternating Weighted Automata
• Alternating Weighted Automata
• Weak alternating automata are not that weak
• Alternation
• Reducibility among Combinatorial Problems
• Quantitative Analysis of Lattice-valued Kripke Structures
• An automata-theoretic approach to branching-time model checking
• Lattice Automata
• The complexity of theorem-proving procedures