Lattice valued relations and automata (Q799110): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:15, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lattice valued relations and automata |
scientific article |
Statements
Lattice valued relations and automata (English)
0 references
1984
0 references
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.
0 references
fuzzy automata
0 references
homogeneity
0 references
lattice valued relations
0 references
stochastic automata
0 references