Lattice-valued automata and their languages
Li Yong · Journal of Shaanxi Normal University · 2003
Latticevalued automata (LA) and their languages are introduced. The sufficient and necessary conditions for the extension of state transition function are given. The sufficient and necessary conditions for the equivalence of deterministic LA and LA are proved. Finally, the closeness of families of languages of LAs under regular operations are shown and some conditions for the closeness of families of languages of LAs under intersection and reversal operations are studied. The obtained results show the close links between the LA and the algebraic properties of lattice monoid.