Fuzzy alternating automata over distributive lattices

An Automata‐Theoretic Approach to L ‐valued Computation Tree Logic Model Checking

“…The dual operation on B + (L ∪ X) is defined as that in Refs. [25,26]. Note that A is a co-Büchi automaton and the accepting condition is a co-Büchi one.…”

“…Shortly afterwards, Li et al gave an automata-based method to fuzzy LTL model checking based on Refs. [25,26].…”

On typical hesitant fuzzy automata

“…This model is widely used for modeling applications in hardware and software [5], and it is also essential for building compilers [4,6]. In recent years, several generalizations of the concept of finite automata have been presented, such as fuzzy automata [7,8,9,10,11], probabilistic automata [12,13,14], and quantum automata [15,16,17,18,19].…”