Fuzzy alternating Büchi automata over distributive lattices
From MaRDI portal
(Redirected from Publication:1678419)
Abstract: We give a new version of fuzzy alternating 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 -fuzzy nondeterministic automata have the same expressive power as -fuzzy alternating ones. A direct construction (without related knowledge about -fuzzy nondeterministic ones such as: above equivalence relation and their closure properties) is given to show that the languages recognized by -fuzzy alternating co- automata are also -fuzzy -regular. Furthermore, the closure properties and the discussion about decision problems for fuzzy alternating automata are illustrated in our paper.
Recommendations
Cites work
- scientific article; zbMATH DE number 1479635 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Alternating Weighted Automata
- Alternating finite automata on -words
- Alternation
- An automata-theoretic approach to branching-time model checking
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Finite automata theory with membership values in lattices
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Lattice Automata
- Max and sum semantics for alternating weighted automata
- Model checking of linear-time properties in multi-valued systems
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Quantitative analysis of lattice-valued Kripke structures
- Quantitative model checking of linear-time properties based on generalized possibility measures
- Reasoning about infinite computations
- The complexity of verification
- Translating to co-Büchi made tight, unified, and useful
- Weak alternating automata are not that weak
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
- scientific article; zbMATH DE number 7317445 (Why is no real title available?)
- 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)