2016/03/15 by Xiujuan Wei, Yongming Li, Wei, Xiujuan +1
Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic, Reasoning, and Knowledge #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1603.04541
openalex publication_date 2016/03/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give a new version of fuzzy alternating \mathrmBuchi 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 \mathrmBuchi automata have the same expressive power as L-fuzzy alternating \mathrmBuchi ones. A direct construction (without related knowledge about L-fuzzy nondeterministic \mathrmBuchi ones such as: above equivalence relation and their closure properties) is given to show that the languages recognized by L-fuzzy alternating co-\mathrmBuchi automata are also L-fuzzy ω-regular. Furthermore, the closure properties and the discussion about decision problems for fuzzy alternating \mathrmBuchi automata are illustrated in our paper.