A residuated function in a class of Mealy type L-Valued finite automaton

On typical hesitant fuzzy automata

“…The infimum when it exists, is denoted by A, and in the case of A = {x, y}, we write the infimum of A as being x ∧ y. A poset L such that all finite and nonempty subset of L has supremum and infimum, is called a lattice (Farias et al 2016b). All lattices have an algebraic version based on the operations of supremum and infimum (Balbes and Dwinger 1974;Farias et al 2016b), which is denoted by L, ∨, ∧ .…”

“…A poset L such that all finite and nonempty subset of L has supremum and infimum, is called a lattice (Farias et al 2016b). All lattices have an algebraic version based on the operations of supremum and infimum (Balbes and Dwinger 1974;Farias et al 2016b), which is denoted by L, ∨, ∧ . In this paper, we adopt this notation.…”

“…Finite automata are a computational model that has finite memory limitation. 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].…”