Fuzzy alternating Büchi automata over distributive lattices

DOI10.1016/J.IJAR.2017.07.007zbMATH Open1419.68062DBLPjournals/ijar/WeiL17arXiv1603.04541OpenAlexW2737951903WikidataQ62038062 ScholiaQ62038062MaRDI QIDQ1678419FDOQ1678419

Authors: Xiujuan Wei, Yongming Li 

Publication date: 17 November 2017

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Abstract: We give a new version of fuzzy alternating $mathrmBddotuchi$ automata over distributive lattices: weights are putting in every leaf node of run trees rather than along with edges from every node to its children. Such settings are great benefit to obtain complement just by taking dual operation and replacing each final weight with its complement. We prove that $L$-fuzzy nondeterministic $mathrmBddotuchi$ automata have the same expressive power as $L$-fuzzy alternating $mathrmBddotuchi$ ones. A direct construction (without related knowledge about $L$-fuzzy nondeterministic $mathrmBddotuchi$ ones such as: above equivalence relation and their closure properties) is given to show that the languages recognized by $L$-fuzzy alternating co-$mathrmBddotuchi$ automata are also $L$-fuzzy $omega$-regular. Furthermore, the closure properties and the discussion about decision problems for fuzzy alternating $mathrmBddotuchi$ automata are illustrated in our paper.

Full work available at URL: https://arxiv.org/abs/1603.04541

Recommendations

• Fuzzy alternating automata over distributive lattices
• \(L\)-valued alternating tree automata
• Fuzzy \(\omega\)-automata
• Infinite fuzzy computations
• Alternating automata on infinite trees

zbMATH Keywords

distributive latticesfuzzy automataalternating automatafuzzy alternating Büchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Alternation
• A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
• Finite automata theory with membership values in lattices
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Automata theory based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic. II
• Title not available (Why is that?)
• Reasoning about infinite computations
• An automata-theoretic approach to branching-time model checking
• Alternating finite automata on \(\omega\)-words
• Weak alternating automata are not that weak
• Alternating Weighted Automata
• Title not available (Why is that?)
• Lattice Automata
• Translating to co-Büchi made tight, unified, and useful
• Nondeterministic fuzzy automata with membership values in complete residuated lattices
• Quantitative analysis of lattice-valued Kripke structures
• The complexity of verification
• 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)

• Infinite fuzzy computations
• Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them
• Fuzzy alternating automata over distributive lattices
• Title not available (Why is that?)
• Lattice-valued tree pushdown automata: pumping lemma and closure properties
• Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures

This page was built for publication: Fuzzy alternating Büchi automata over distributive lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678419)