摘要
It reveals some equivalences between automata based on complete residuated lattice-valued logic (called (?) valued automata) and the truth-value lattice of the underlying logic (i.e. residuated lattice). In particular, it demonstrates several basic equivalent characterizations on the retriev-ability of (?) valued automata. Finally, the connections of the homomorphisms between two eeeeeeeeee valued automata to continuous mappings and open mappings are clarified. So this paper establishes further the more profound fuzzy automata theory.
It reveals some equivalences between automata based on complete residuated lattice-valued logic (called (?) valued automata) and the truth-value lattice of the underlying logic (i.e. residuated lattice). In particular, it demonstrates several basic equivalent characterizations on the retriev-ability of (?) valued automata. Finally, the connections of the homomorphisms between two eeeeeeeeee valued automata to continuous mappings and open mappings are clarified. So this paper establishes further the more profound fuzzy automata theory.
基金
This work was supported by the National Foundation for Distinguished Young Scholars (Grant No. 69725004)
the National Key Project for Basic Research (Grant No. 1998030509).
