Lattice valued relations and automata
This paper discusses homogeneity by proving the central classification theorem in terms of a group quotient for lattice valued relations. Furthermore, it is shown how any group can be employed to construct a ''very homogeneous'' object. The specification of automata as lattice valued relation is devoted. The ''very homogeneous'' requirement emerges as demand that every input is bijective and that the input set is closed under conjugation. A brief discussion of the lattice valued relation theory of fuzzy and stochastic automata is given.
scientific article; zbMATH DE number 3872687
scientific article