Products and Covering of Lattice-valued Finite Automata
Download as PDF
DOI: 10.25236/icemit.2018.312
Author(s)
Lou Quanfu, Hu Zhonggang
Corresponding Author
Lou Quanfu
Abstract
In this paper, the new concept of covering for lattice-valued finite automata was given. The product relations between various lattice-valued finite automata, the covering relations between various products of two lattice-valued finite automata, and covering relations between products of two lattice-valued finite automata and products of the other two lattice-valued finite automata which cover them are studied.
Keywords
Lattice-Valued Finite Automata, Homomorphism, Full Direct Product, Restricted Product, Cascade Product, Wreath Product, Coverings.