Automata theory based on complete residuated lattice-valued logic (II)
Daowen Qiu · Science in China Series F Information Sciences · 2002
It reveals some equivalences between automata based on complete residuated lattice-valued logic (called l 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 retrievability of l valued automata. Finally, the connections of the homomorphisms between two l valued automata to continuous mappings and open mappings are clarified. So this paper establishes further the more profound fuzzy automata theory.