Lattice valued relations and automata
type: Item
instance of: scholarly article
title: Lattice valued relations and automata
zbMATH Open document ID: 0547.68052
DOI: 10.1016/0166-218X(84)90114-8
author: N. E. Zubov
published in: Discrete Applied Mathematics
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03E20
zbMATH DE Number: 3872687
zbMATH Keywords: fuzzy automata
zbMATH Keywords: homogeneity
zbMATH Keywords: lattice valued relations
zbMATH Keywords: stochastic automata
MaRDI profile type: Publication
cites work: Automata theory and control theory - a rapprochement
cites work: Q5588674
cites work: Q5590815
cites work: The construction of homogeneous nets
cites work: FUZZY SETS AND PROBABILITY
cites work: Q3913431
cites work: THE DECOMPOSITION OF TOLERANCE AUTOMATA
cites work: Homology theories and tolerance automata
cites work: Semi-group, group quotient and homogeneous automata
cites work: A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
cites work: Fuzzy sets
cites work: The topology of the brain and visual perception
description: scientific article; zbMATH DE number 3872687